Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz

  • Authors:

  • J. a. Loera;J. Lee;S. Margulies;S. Onn

  • Affiliations:

  • Department of mathematics, university of california, davis, california, usa (e-mail: deloera@math.ucdavis.edu);Ibm t. j. watson research center, yorktown heights, new york, usa (e-mail: jonlee@us.ibm.com);Department of computer science, university of california, davis, california, usa (e-mail: smargulies@ucdavis.edu);Davidson faculty of ie & m, technion – israel institute of technology, haifa, israel (e-mail: onn@ie.technion.ac.il)

  • Venue:
  • Combinatorics, Probability and Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colourable, Hamiltonian, etc.) if and only if a related system of polynomial equations has a solution. For an infeasible polynomial system, the (complex) Hilbert Nullstellensatz gives a certificate that the associated combinatorial problem is infeasible. Thus, unless P = NP, there must exist an infinite sequence of infeasible instances of each hard combinatorial problem for which the minimum degree of a Hilbert Nullstellensatz certificate of the associated polynomial system grows. In the first part of the paper, we show that the minimum degree of a Nullstellensatz certificate for the non-existence of a stable set of size greater than the stability number of the graph is the stability number of the graph. Moreover, such a certificate contains at least one term per stable set of G. In contrast, for non-3-colourability, we proved that the minimum degree of a Nullstellensatz certificate is at least four. Our efforts so far have only yielded graphs with Nullstellensatz certificates of precisely that degree. In the second part of this paper, for the purpose of computation, we construct new polynomial encodings for the problems of finding in a graph its longest cycle, the largest planar subgraph, the edge-chromatic number, or the largest k-colourable subgraph. We include some applications to graph theory.