A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
From MaRDI portal
Publication:1260758
DOI10.1006/jsco.1993.1011zbMath0783.14039MaRDI QIDQ1260758
Publication date: 25 August 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bae99681eadbe82fab25b8cddd83be93e4cdd246
polynomial ideal theory; decomposition of an algebraic variety; greatest common divisors of univariate polynomials
13F20: Polynomial rings and ideals; rings of integer-valued polynomials
13P05: Polynomials, factorization in commutative rings
14A10: Varieties and morphisms
14Q99: Computational aspects in algebraic geometry
Related Items
On computer-assisted classification of coupled integrable equations, A systematic framework for solving geometric constraints analytically, Unmixed-dimensional decomposition of a finitely generated perfect differential ideal, A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers, Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case, Mechanical geometry theorem proving based on Gröbner bases, Thirty years of polynomial system solving, and now?, A characteristic set method for ordinary difference polynomial systems, Computing representations for radicals of finitely generated differential ideals, On the complexity of counting components of algebraic varieties, Computing differential characteristic sets by change of ordering, Factorization-free decomposition algorithms in differential algebra, Computing triangular systems and regular systems, On the theories of triangular sets, Triangular sets for solving polynomial systems: a comparative implementation of four methods, An algorithm for isolating the real solutions of semi-algebraic systems, A generalized Euclidean algorithm for geometry theorem proving, Real solution isolation using interval arithmetic, An algorithm for decomposing a polynomial system into normal ascending sets, On approximate triangular decompositions in dimension zero, Change of order for regular chains in positive dimension, An alternative algorithm for computing the pseudo-remainder of multivariate polynomials, Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems, An Algorithm for Transforming Regular Chain into Normal Chain
Uses Software
