Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2008, Pages 197-206

  De Loera, Jesús A ^a   Lee, Jon ^b   Malkin, Peter N ^a   Margulies, Susan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithms

Indexed keywords

COLOR ABILITIES; COMBINATORIAL PROBLEMS; COMBINATORICS; GRAPH PROBLEMS; HILBERT; LOW DEGREES; OF GRAPHS; POLYNOMIAL EQUATIONS; POLYNOMIAL SYSTEMS; RELATED SYSTEMS;

POLYNOMIAL APPROXIMATION; POLYNOMIALS;

COMBINATORIAL MATHEMATICS;

EID: 57449108899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390768.1390797     Document Type: Conference Paper

References (16)

1. N. Alon, Combinatorial Nullstellensatz, Combinatorics, Probability and Computing, 8, (1999), 7-29.
2. D.A. Bayer, "The Division Algorithm and the Hilbert Scheme," Ph.D. Thesis, Harvard University, (1982).
3. S. Buss and T. Pitassi, Good degree bounds on nullstellensatz refutations of the induction principle, IEEE Conference on Computational Complexity, (1996), 233-242.
4. CoCoATeam, CoCoA: a system for doing Computations in Commutative Algebra, available at http://cocoa.dima.unige.it.
5. D. Cox, J. Little and D. O'Shea, "Ideals, Varieties and Algorithms," Springer Undergraduate Texts in Mathematics, Springer-Verlag, New York, (1992).
6. J.A. De Loera, J. Lee, S. Margulies, S. Onn, Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz, submitted manuscript 2007, see http://arxiv.org/abs/0706.0578
7. C.J. Hillar and T. Windfeldt, "An algebraic characterization of uniquely vertex colorable graphs," Journal of Combinatorial Theory Series B, 98 (2008), 400-414.
8. P. Impagliazzo, P. Pudlák and J. Sgall, Lower bounds for polynomial calculus and the Groebner basis algorithm. Computational Complexity, 8, (1999), 127-144.
9. E. Koester, On 4-critical planar graphs with high edge density, Discrete Mathematics, 98, (1991), 147-151.
10. J. Kollar, Sharp effective Nullstellensatz, Journal of the AMS, 1(4), (1988), 963-975.
11. J.B. Lasserre, Polynomials nonnegative on a grid and discrete optimization, Transactions of the AMS, 354(2), (2001), 631-649.
12. I. Méndez-Díaz and P. Zabala, "A branch-and-cut algorithm for graph coloring," Discrete Applied Mathematics, Vol. 154(5), (2006), 826-847.
13. M. Laurent, Semidefinite representations for finite varieties, Mathematical Programming, 109, (2007), 1-26.
14. L. Lovász, Stable sets and polynomials, Discrete Mathematics, 124, (1994), 137-153.
15. S. Margulies, "Computer Algebra, Combinatorics, and Complexity: Hilbert's Nullstellensatz and NP-Complete Problems," UC Davis Ph.D. dissertation, in preparation, (2008).
16. P. Parrilo, Semidefinite programming relaxations for semialgebraic problems," Mathematical Programming, Series B, 96(2), (2003), 293-320.