Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals

We revisit a well-known family of polynomial ideals encoding the problem of graph-$k$-colorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically, we provide lower bounds on the difficulty of computing Gr\"obner bases and Nullstellensatz certificates for the coloring ideals of general graphs. For chordal graphs, however, we explicitly describe a Gr\"obner basis for the coloring ideal, and provide a polynomial-time algorithm.

[1]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 2000, Comb..

[2]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[3]  D. Bayer.  The division algorithm and the hilbert scheme , 1982 .

[4]  J. Kollár.  Sharp effective Nullstellensatz , 1988 .

[5]  W. Brownawell.  Bounds for the degrees in the Nullstellensatz , 1987 .

[6]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[7]  Christopher J. Hillar,et al.  Algebraic characterization of uniquely vertex colorable graphs , 2008, J. Comb. Theory, Ser. B.

[8]  Jesús A. De Loera,et al.  Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility , 2008, ISSAC '08.

[9]  Stephan Ritscher,et al.  Degree Bounds for Zero-dimensional Gröbner Bases , 2009 .

[10]  Thomas Dubé,et al.  The Structure of Polynomial Ideals and Gröbner Bases , 2013, SIAM J. Comput..

[11]  Michal Mnuk.  Representing Graph Properties by Polynomial Ideals , 2001 .

[12]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

[13]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  Samuel R. Buss,et al.  Good degree bounds on Nullstellensatz refutations of the induction principle , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[16]  Susan S. Margulies,et al.  Computer algebra, combinatorics, and complexity: hilbert's nullstellensatz and np-complete problems , 2008 .

[17]  Marina Weber,et al.  Using Algebraic Geometry , 2016 .

[18]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[19]  Stephan Ritscher,et al.  Degree bounds for Gröbner bases of low-dimensional polynomial ideals , 2010, ISSAC.

[20]  Noga Alon.  Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.

[21]  Martin Kreuzer,et al.  Computational Commutative Algebra 1 , 2000 .

[22]  D. Loera,et al.  Gröbner bases and graph colorings. , 1995 .

[23]  R. Impagliazzo,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[24]  Oleg Golberg.  Combinatorial Nullstellensatz , 2007 .

[25]  D. Lazard.  Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination , 1977 .

[26]  Yu. V. Matiyasevich.  Some Algebraic Methods for Calculating the Number of Colorings of a Graph , 2004 .

[27]  Carlos D'Andrea,et al.  Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze , 2011, 1103.4561.

[28]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[29]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[30]  Pablo A. Parrilo,et al.  Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization , 2009, 0909.0808.

[31]  Ernst W. Mayr,et al.  Some Complexity Results for Polynomial Ideals , 1997, J. Complex..

[32]  Jesús A. De Loera,et al.  Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz , 2011, J. Symb. Comput..

[33]  László Lovász,et al.  Stable sets and polynomials , 1994, Discret. Math..

[34]  S. Onn,et al.  Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz , 2007, 0706.0578.

[35]  W. W. Adams,et al.  An Introduction to Gröbner Bases , 2012 .

[36]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[37]  S. R. Czapor,et al.  Computer Algebra , 1983, Computing Supplementa.

[38]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[39]  Jean-Charles Faugère,et al.  Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering , 1993, J. Symb. Comput..