Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (original) (raw)
Related papers
Chordal Networks of Polynomial Ideals
SIAM Journal on Applied Algebra and Geometry
We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables. Chordal networks provide a computationally convenient decomposition into simpler (triangular) polynomial sets, while preserving the underlying graphical structure. We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components is exponentially large. Chordal networks can be computed for arbitrary polynomial systems using a refinement of the chordal elimination algorithm from [9]. Furthermore, they can be effectively used to obtain several properties of the variety, such as its dimension, cardinality, and equidimensional components, as well as an efficient probabilistic test for radical ideal membership. We apply our methods to examples from algebraic statistics and vector addition systems; for these instances, algorithms based on chordal networks outperform existing techniques by orders of magnitude.
Gröbner Bases and Polynomial Equations
2016
Let S = k[x1, x2, . . . , xn] denote a polynomial ring over a field k where x1, x2, . . . , xn are indeterminates. A Gröbner basis is a set of polynomials in S which has several remarkable properties which enable us to carry out standard operations on ideals, rings and modules in an algorithmic way. Every set of polynomials in S can be transformed into a Gröbner basis. This process generalises three important algorithms: (1) Gauss elimination method for solving a system of linear equations, (2) Euclid’s algorithm for finding the greatest common divisor and (3) The simplex method of linear programming. One of the goals of these two lectures is to explain how to reduce the problem of solving a system of polynomial equations to a problem of finding eigenvalues of commuting matrices. We will introduce term orders first on the set of monomials in S and define the concept of Gróbner basis of an ideal. Term orders on monomials in k[x1, x2, . . . , xn] The set of monomials in the polynomial...
Recognizing graph theoretic properties with polynomial ideals
the electronic journal of …, 2010
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.
Efficiently computing Groebner bases of ideals of points
2007
We present an algorithm for computing Gröbner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies a set of essential variables, which reduces the time complexity with respect to the number of indeterminates, and then uses PLU decompositions to reduce the time complexity with respect to the number of points. This gives a theoretical upper bound for its time complexity that is an order of magnitude lower than the known one for the standard Buchberger-Möller algorithm if the number of indeterminates is much larger than the number of points. Comparison of implementations of our algorithm and the standard Buchberger-Möller algorithm in Macaulay 2 confirm the theoretically predicted speedup. This work is motivated by recent applications of Gröbner bases to the problem of network reconstruction in molecular biology.
On the robust hardness of Gröbner basis computation
Journal of Pure and Applied Algebra
The computation of Gröbner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the problem of approximate computation of Gröbner bases. We show that it is NP-hard to construct a Gröbner basis of the ideal generated by a set of polynomials, even when the algorithm is allowed to discard a 1 − ǫ fraction of the generators, and likewise when the algorithm is allowed to discard variables (and the generators containing them). Our results shows that computation of Gröbner bases is robustly hard even for simple polynomial systems (e.g. maximum degree 2, with at most 3 variables per generator). We conclude by greatly strengthening results for the Strong c-Partial Gröbner problem posed by De Loera et al. [10]. Our proofs also establish interesting connections between the robust hardness of Gröbner bases and that of SAT variants and graph-coloring.
Software Engineering and complexity in effective Algebraic Geometry
Journal of Complexity, 2013
One may represent polynomials not only by their coefficients but also by arithmetic circuits which evaluate them. This idea allowed in the last fifteen years considerable complexity progress in effective polynomial equation solving. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective Algebraic Geometry and exhibit a class of simple elimination problems which require exponential size circuits to be solved in this model. This implies that the known, circuit based elimination algorithms are already optimal.
2008
We present a novel approach for solving systems of polynomial equations via graph partitioning. The concept of a variable-sharing graph of a system of polynomial equations is defined. If such graph is disconnected, then the system of equations is actually two separate systems that can be solved individually. This can provide a significant speed-up in computing the solution to the system, but is unlikely to occur either randomly or in applications. However, by deleting a small number of vertices on the graph, the variablesharing graph could be disconnected in a balanced fashion, and in turn the system of polynomial equations are separated into smaller ones of similar sizes. In graph theory terms, this process is equivalent to finding balanced vertex partitions with minimum-weight vertex separators. The techniques of finding these vertex partitions are discussed, and experiments are performed to evaluate its practicality for general graphs and systems of polynomial equations. Applications of this approach to the QUAD family of stream ciphers, algebraic cryptanalysis of the stream cipher Trivium and its variants, as well as some mathematical problems in game theory and computational algebraic geometry are presented. In each of these cases, the systems of polynomial equations involved are well-suited to our graph partitioning method, and constructive results are discussed.
A Survey on the Complexity of Solving Algebraic Systems
International Mathematical Forum, 2010
This paper presents a lecture on existing algorithms for solving polynomial systems with their complexity analysis from our experiments on the subject. It is based on our studies of the complexity of solving parametric polynomial systems. It is intended to be useful to two groups of people: those who wish to know what work has been done and those who would like to do work in the field. It contains an extensive bibliography to assist readers in exploring the field in more depth. The paper provides different methods and techniques used for representing solutions of algebraic systems that include Rational Univariate Representations (RUR), Gröbner bases, etc.
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
… of the 2009 international symposium on …, 2009
In this paper, we propose an efficient method to solve polynomial systems whose equations are left invariant by the action of a finite group G. The idea is to simultaneously compute a truncated SAGBI-Gröbner bases (a generalisation of Gröbner bases to ideals of subalgebras of polynomial ring) and a Gröbner basis in the invariant ring K[σ1, . . . , σn] where σi is the i-th elementary symmetric polynomial.