A new method for solving algebraic systems of positive dimension
Let \(R_ 0\) be a domain with the field of fractions \(K_ 0\) and let \(S_ 0\) be a multiplicative set of \(R_ 0\). For a natural number \(n\), let \(R_ n=R_ 0[X_ 1,\ldots,X_ n]\) and \(P_ n=K_ 0[X_ 1,\ldots,X_ n]\). An algebraic system is a finite set \(E=\{e_ 1,\ldots,e_ k\}\) of \(R_ n\). To each prime ideal \(I\) in \(P_ n\), let \(I_ i=I\cap R_ i\), \(A_ i=R_ i/I_ i\) and \(K_ i\) the field of fractions of \(A_ i\). Then the set of fields \(K_ 0,\ldots,K_ n\) is called the tower associated with the prime ideal \(I\). If \(f\in R_ i\backslash R_{i-1}\), the main variable of \(f\) is defined to be \(X_ i\) and its index to be \(i\). Further, the degree of \(f\) means its degree in \(X_ i\) and the leading coefficient is its coefficient in \(R_{i-1}\) of the highest power of \(X_ i\). The corresponding functions are denoted respectively by main(\(f\)), index(\(f\)), \(\deg(f)\), lc(\(f\)). Using this terminology, the author defines: Definition 3.2. A triangular set in \(R_ n\) is a list of non-constant polynomials \((f_ 1,\ldots,f_ k)\) in \(R_ n\) satisfying the following for \(i=1,\ldots,k\): (1) [weak triangular] \(\text{index}(f_ j)<\text{index}(f_ i)\) for \(j<i\); then inductively, let \(K_ j=K_{j-1}[X_ j]/(f_ i)\) if \(\text{index}(f_ i)=j\) and \(qf(K_{j-1}[X_ j])\) (the total quotient ring) otherwise: (2) [reduced] the degree of \(f_ i\) in main\((f_ j)\) is strictly less than \(\deg(f_ j)\) for \(j=1,\ldots,i-1\); (3) [normalized] \(\text{index(lc}^ h(f_ i))\notin \{\text{index}(f_ 1),\ldots,\text{index}(f_{i-1})\}\) for any \(h>0\); (4) [\(R_ 0\)-normalized] if \(\text{lc}^ h(f_ i))\in R_ 0\), then \(\text{lc}^ h(f_ i))\in S_ 0\); (5) [square-free] the resultant of \(f_ i\) and its derivative with respect to \(\text{main}(f_ i)\) is invertible in \(K_{j-1}\), where \(j=\text{index}(f_ i)\); (6) [primitive] the coefficients of \(f_ i\) viewed as a multivariate polynomial over \(K_{j-1}[X_ j]\) generate the unit ideal of \(K_{j- 1}[X_ j]\) for all \(j<\text{index}(f_ i)\). And, the author remarks: Proposition 3.3. Let \(I\) be a prime ideal, and \(K_ 0,\ldots,K_ n\) the associated tower; if \(K_ i\) is algebraic over \(K_{i-1}\), the minimal polynomial of \(x_ i\) over \(K_{i-1}\) may be chosen in \(R_ i\) such that the set of these polynomials forms a triangular set. There is exactly one such choice. Proposition 3.4. Let \(f_ 1,\ldots,f_ k\) be a triangular set, \(h=\text{lc}(f_ 1)\cdots\text{lc}(f_ k)\) and let \(I=\{p\in P_ n\mid h^ ep\in(f_ 1,\ldots,f_ k)\}\). Then if the triangular system is associated with a prime ideal \(J\), we have \(I=J\). Corollary 3.5. The set of generators of the ideal \(I\) above is computable from the triangular set. Then the author shows how to compute numerically the common zeros of a given prime ideal, using the associated triangular set.
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Complexity of a standard basis of a D-module.
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4118469 (Why is no real title available?)
- Solving zero-dimensional algebraic systems
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- A characteristic set method for ordinary difference polynomial systems
- Fast arithmetic for triangular sets: from theory to practice
- On the complexity of counting components of algebraic varieties
- Computing differential characteristic sets by change of ordering
- A note on upper bounds for ideal-theoretic problems
- Examples of using dynamic constructible closure.
- Computing triangular systems and regular systems
- Characteristic decomposition: from regular sets to normal sets
- An equivalence theorem for regular differential chains
- On the theories of triangular sets
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Complexity results for triangular sets
- A generalized Euclidean algorithm for geometry theorem proving
- Rational general solutions of trivariate rational differential systems
- On solving parametric polynomial systems
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Computing real radicals and S-radicals of polynomial systems
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- Computing strong regular characteristic pairs with Gröbner bases
- Multiplicity-preserving triangular set decomposition of two polynomials
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- 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
- On the theory of resolvents and its applications.
- On approximate linearized triangular decompositions
- On non-binomial structure of cyclic 8-roots
- An Algorithm for Transforming Regular Chain into Normal Chain
- Stability analysis for discrete biological models using algebraic methods
- Rational general solutions of higher order algebraic ODEs
- scientific article; zbMATH DE number 27364 (Why is no real title available?)
- Algorithms for computing triangular decomposition of polynomial systems
- Characteristic set algorithms for equation solving in finite fields
- A Moment Approach to Analyze Zeros of Triangular Polynomial Sets
- Triangular systems and a generalization of primitive polynomials
- Relaxed Hensel lifting of triangular sets
- scientific article; zbMATH DE number 804603 (Why is no real title available?)
- Decomposition of polynomial sets into characteristic pairs
- Chordality preserving incremental triangular decomposition and its implementation
- The application of normal ascending set in solving system of parametric algebraic equations
- A moment approach to analyze zeros of triangular polynomial sets
- On computer-assisted classification of coupled integrable equations
- A systematic framework for solving geometric constraints analytically
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- On the links between triangular sets and dynamic constructible closure
- Mode decomposition of global bifurcation diagram with Gröbner bases
- A Direttissimo Algorithm for Equidimensional Decomposition
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Algorithms for multivariate laurent series
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Satisfiability modulo finite fields
- Bit-size estimates for triangular sets in positive dimension
- On formal power series solutions of regular differential chains
- Choosing variable orderings based on elimination tree for sparse triangular decomposition
- Simple characteristic decomposition of polynomial sets
- A syzygial method for equidimensional decomposition
- Decomposition of polynomial ideals into triangular regular sequences
- Complexity analysis of triangular decomposition over F₂ with strongly chordal graphs
- Properness defects of projection and minimal discriminant variety
- Structural analysis of oligopoly equilibria based on triangular decomposition and cylindrical algebraic decomposition. Structural analysis of oligopoly equilibria
- Strongly and transitive chordal graphs and their applications in complexity analysis of triangular decomposition
- Sum-and-quotient characteristic decomposition of polynomial ideals
This page was built for publication: A new method for solving algebraic systems of positive dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180160)