Skip to main content
For Better Performance Please Use Chrome or Firefox Web Browser
Amir Hashemi
Professor of Mathematics
Search form
Search
English
فارسی
Welcome to Amir Hashemi
No front page content has been created yet.
Office
: 71
Email
: FirstName.LastName@iut.ac.ir
Phone
: +98 313 391 36 35
Fax
: +98 313 391 26 02
Web Site
:
Amir Hashemi
Professor of Mathematics
Research Fields
:
Computer Algebra
Home
Biography
Education
Professional Career
Visits and Scholarships
List of Publications
Software
Teaching
Research Interests
Students
Teaching
ریاضی یک عمومی
هندسه جبری
Algebraic Geometry
Recent Publications
A new algorithm for Gröbner bases conversion
Machine learning parameter systems, Noether normalisations and quasi-stable positions
A single exponential time algorithm for homogeneous regular sequence tests"
A Parametric F4 Algorithm
A new algorithm for computing staggered linear bases
Recursive structures in involutive bases theory
On the complexity of linear algebra operations over algebraic extension fields
Computation of Macaulay constants and degree bounds for Grobner bases
Une generalisation du critere de Boulier--Buchberger pour le calcul des ensembles caracteristiques d’ideaux differentiels
Complementary decompositions of monomial ideals and involutive bases
On Bezout inequalities for non-homogeneous polynomial ideals
Compact packings of the plane with three sizes of discs
Degree upper bounds for involutive bases
On the construction of staggered linear bases
پایه های تودرتو و کاربردهای آنها
Computing the resolution regularity of bi-homogeneous ideals
An involutive GVW algorithm and the computation of Pommaret bases
Relative Grobner and involutive bases for ideals in quotient rings
Dimension and Depth Dependent Upper Bounds in Polynomial Ideal Theory
Computing H-bases via minimal bases for syzygy modules
Intrinsic complexity for constructing zero-Dimensional Grobner bases
Noether Bases and Their Applications
Compact Packings of the Plane with Three Sizes of Discs
Computing all border bases for ideals of points
Refined algorithm to compute minimal H-bases
Grobner bases and multi-dimensional persistent bifurcation diagram classifications
Deterministic genericity for polynomial ideals.
A Pommaret bases approach to the degree of a polynomial ideal
Degree upper bounds for H-bases
Universal Grobner Basis for Parametric Polynomial Ideals
Computation of Pommaret Bases Using Syzygies
Dimension-Dependent Upper Bounds for Grobner Bases
Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units
Parametric FGLM algorithm
Grobner Systems Conversion
Lie Algebras of Infinitesimal CR Automorphisms of Weighted Homogeneous and Homogeneous CR-Generic Submanifolds of C^N
Improved Computation of Involutive Bases
A Note on Dynamic Grobner Bases Computation
Simple Proofs of Some Theorems in Resultant Theory
Regular Chains under Linear Changes of Coordinates and Applications
Effective Computation of Radical of Ideals and Its Application to Invariant Theory
An Improvement of Rosenfeld-Grobner Algorithm
Deterministically Computing Reduction Numbers of Polynomial Ideals
Solving Linear System of Equations over Integers with Groebner Bases
Applying Buchberger’s Criteria for Computing Grobner Basis over Finite Chain Rings
Classification of Finite Rings: Theory and Algorithm
Computing Minimal Polynomial of Matrices over Algebraic Extension Fields
Applications of Differential Algebra for Computing Lie Algebras of Infnitesimal CR-automorphisms
Direct Calculation of the 7 Parameters Transformation Problem
Involutive Bases Algorithm Incorporating F5 Criterion
On Application of Buchberger's Criteria in G2V Algorithm for Computing Grobner Bases
Invariant G2V Algorithm for Computing SAGBI-Grobner Bases
Minimal Polynomial Systems for Parametric Matrices
A Note on Grobner Bases and Graph Colorings
Efficient Computation of Castelnuovo-Mumford Regularit
Applying Buchberger's Criteria on Montes DISPGB Algorithm
Quasi-Stability Versus Genericity
Comprehensive Involutive Systems
A Variant of Gerdt's Algorithm for Computing Involutive Bases
Using Grobner Bases for Factoring Polynomials over Algebraic Extension Fields
Sharper Complexity Bounds for Zero-dimensional Grobner Bases and Polynomial System Solving
Applying IsRewritten Criterion on Buchberger Algorithm
Erratum to "A New Algorithm for Discussing Grobner Bases with Parameters" [J.S.C. 33(1-2)(2002) 183-208]
A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction
Computing Syzygies by Faugère’s F5 Algorithm
Orientation Relative a Partir de 3 Points Homologues et de la Direction Verticale
Strong Noether Position and Stabilized Regularities
Extended F5 Criteria
A Hybrid Algorithm for Solving 7 Parameters Transformation
Nullstellensatze for Zero-dimensional Grobner Bases
Efficient Algorithms for Computing Noether Normalization
Efficient Computation of Syzygies by Faugere's F5 Algorithm
Polynomial-Time Algorithm for Hilbert Series of Borel Type Ideals
Polynomial Complexity for Hilbert Series of Borel Type Ideals
Strong Noether Position
Structure and Complexity of Grobner Bases
Fuzzy Sets From a Meta-System-Theoretic Point of View
Almost polynomial Complexity for Zero-dimensional Grobner Bases
A Note on the Fitting Ideals in Free Resolutions
A General Model for I/O System Theory
پایه های تودرتو و کاربردهای آنها
ارتقاء امنیت وب با وف ایرانی