On the theories of triangular sets
From MaRDI portal
Different notions of \textit{triangular sets} under various names and definitions (as characteristic sets, regular chains, normalized triangular sets) appear in several papers trying to describe the solutions of systems of multivariate polynomial equations by means of simpler systems of polynomials. In this paper, the authors study the theoretical relationship between characteristic sets [see \textit{J. Ritt}, Differential equations from the algebraic standpoint, Vol. 14, New York, American Mathematical Society (1932; Zbl 0005.39404) and \textit{W. T. Wu}, Basic principles of mechanical theorem proving in elementary geometries, J. Syst. Sci. Math. Sci. 4, 207-235 (1984)], regular chains [\textit{M. Kalkbrener}, Three contributions to elimination theory. Ph. D. Thesis, Johannes Kepler University, Linz (1992; Zbl 0773.13008)], towers of simple extensions [\textit{D. Lazard}, Discrete Appl. Math. 33, 147-160 (1991; Zbl 0753.13013)] and regular sets [\textit{M. Moreno Maza}, Calculs de pgcd au-dessus des tours d'extensions simples et résolution des systèmes d'équations algébriques, Ph. D. Thesis, Université Paris 6 (1997)]. After having defined these, they study the basic properties of these sets and give, as their main result, a proof that for a non-empty triangular set, these different notions are equivalent if considered with respect to adequate rings and ideals.
Recommendations
- Proof of a conjecture of Erdős on triangles in set-systems
- On the existence of triangular difference systems of sets
- scientific article; zbMATH DE number 3455459
- scientific article; zbMATH DE number 4014719
- scientific article; zbMATH DE number 2151241
- scientific article; zbMATH DE number 3908501
- Triangular numbers and difference systems of sets
- The space of triangles, vanishing theorems, and combinatorics
- On the certain families of triangles
- A note on triangulations of sumsets
Cites work
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- Algorithmic properties of polynomial rings
- An elimination method for polynomial systems
- Decomposing polynomial systems into simple systems
- scientific article; zbMATH DE number 4213458 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 3176139 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 1057759 (Why is no real title available?)
- scientific article; zbMATH DE number 778203 (Why is no real title available?)
- scientific article; zbMATH DE number 3196340 (Why is no real title available?)
- On the dimension of an arbitrary ascending chain
- Solving zero-dimensional algebraic systems
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
Cited in
(only showing first 100 items - show all)- A characteristic set method for ordinary difference polynomial systems
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Fast arithmetic for triangular sets: from theory to practice
- On the complexity of counting components of algebraic varieties
- Characteristic set method for differential-difference polynomial systems
- Dynamic balancing of planar mechanisms using toric geometry
- Computing differential characteristic sets by change of ordering
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- Factorization-free decomposition algorithms in differential algebra
- Computing triangular systems and regular systems
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Specifications for triangulation algorithms of elementary-algebraic systems
- Using jointly geometry and algebra to determine RC-constructibility
- Characteristic decomposition: from regular sets to normal sets
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems
- On the mechanization of straightedge and compass constructions
- Elimination theory in differential and difference algebra
- An equivalence theorem for regular differential chains
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- An algorithm for isolating the real solutions of semi-algebraic systems
- Real solving for positive dimensional systems.
- Algorithms to compute the topology of orientable real algebraic surfaces
- Complexity results for triangular sets
- Rational general solutions of trivariate rational differential systems
- On solving parametric polynomial systems
- A short contribution to the theory of regular chains
- Clustering complex zeros of triangular systems of polynomials
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
- Symbolic computation for the qualitative theory of differential equations
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Chordal graphs in triangular decomposition in top-down style
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- Computing strong regular characteristic pairs with Gröbner bases
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Generic regular decompositions for generic zero-dimensional systems
- Accelerated tower arithmetic
- Multiplicity-preserving triangular set decomposition of two polynomials
- Commissioning rules for optimal velocity controller damping of servo axes using elimination methods
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- Solving parametric polynomial systems
- Some constructions for real algebraic curves
- 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
- Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- Parallelization of triangular decompositions: techniques and implementation
- Automatic constructibility checking of a corpus of geometric construction problems
- DIMENSIONS OF TRIANGLE SETS
- Recent advances in real geometric reasoning
- An Algorithm for Transforming Regular Chain into Normal Chain
- Modular composition modulo triangular sets and applications
- Rational general solutions of higher order algebraic ODEs
- scientific article; zbMATH DE number 3455459 (Why is no real title available?)
- An improved algorithm for deciding semi-definite polynomials
- Algorithms for computing triangular decomposition of polynomial systems
- Characteristic set algorithms for equation solving in finite fields
- Algorithmic Thomas decomposition of algebraic and differential systems
- On the Bit-Size of Non-radical Triangular Sets
- Tensor inversion and its application to the tensor equations with Einstein product
- scientific article; zbMATH DE number 2151241 (Why is no real title available?)
- A criterion for testing whether a difference ideal is prime
- Triangular systems and a generalization of primitive polynomials
- Relaxed Hensel lifting of triangular sets
- Decomposition of polynomial sets into characteristic pairs
- Comprehensive LU Factors of Polynomial Matrices
- On the Chordality of Simple Decomposition in Top-Down Style
- Characteristic sets verses generalized characteristic sets
- Chordality preserving incremental triangular decomposition and its implementation
- Thomas decomposition and nonlinear control systems
- A test for monomial containment
- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer
- Chordal networks of polynomial ideals
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- A normal form algorithm for regular differential chains
- 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
- On the links between triangular sets and dynamic constructible closure
- 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
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- Algorithms for multivariate laurent series
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- CAD and topology of semi-algebraic sets
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- An enhanced binary characteristic set algorithm and its applications to algebraic cryptanalysis
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- Satisfiability modulo finite fields
- Bit-size estimates for triangular sets in positive dimension
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- On formal power series solutions of regular differential chains
- msolve. A library for solving polynomial systems
- Comprehensive characteristic decomposition of parametric polynomial systems
This page was built for publication: On the theories of triangular sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808664)
