Ideal basis and primary decompositions: case of two variables
From MaRDI portal
Publication:1821556
DOI10.1016/S0747-7171(85)80035-3zbMath0616.68036MaRDI QIDQ1821556
Publication date: 1985
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
computational complexityGröbner basesfactorizationstructural complexityalgorithm for computing primary decompositionstwo- variable polynomials over a fieldunivariate polynomials over a Euclidean ring
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)
Related Items (32)
Primitive polynomial remainder sequences in elimination theory ⋮ The Big Mother of all Dualities: Möller Algorithm ⋮ The big mother of all dualities. 2: Macaulay bases ⋮ Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis ⋮ Gröbner bases and primary decomposition in polynomial rings in one variable over Dedekind domains ⋮ Gröbner bases and primary decomposition of polynomial ideals ⋮ Chinese Remainder Theorem for bivariate lexicographic Gröbner bases ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Towards a Gröbner-free approach to coding ⋮ Using Gröbner bases for finding the logarithmic part of the integral of transcendental functions ⋮ A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)] ⋮ An algorithm to compute the adjoint ideal of an affine plane algebraic curve ⋮ Computing modular correspondences for abelian varieties ⋮ Computing strong regular characteristic pairs with Gröbner bases ⋮ A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices] ⋮ Solving structured linear systems with large displacement rank ⋮ Some results on Gröbner bases over commutative rings ⋮ A note on Gröbner bases and Berlekamp's algorithm ⋮ A new approach to primary decomposition ⋮ Topology of real algebraic space curves ⋮ Direct methods for primary decomposition ⋮ Gröbner bases and primary decomposition of modules ⋮ Detecting algebraic curves in bad position ⋮ Structure of Gröbner bases with respect to block orders ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Hadamard matrices of Williamson type: A challenge for computer algebra ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ Bar code: a visual representation for finite sets of terms and its applications ⋮ Multiplicity-preserving triangular set decomposition of two polynomials ⋮ An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties ⋮ Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
Cites Work
- On constructing bases for ideals in polynomial rings over the integers
- Résolution des systèmes d'équations algébriques
- Description de Hilb sup(n) C{X,Y}
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- Constructions in Algebra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ideal basis and primary decompositions: case of two variables
