Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz

Details Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz

2007-06-05

arxiv.org/abs/0706.0578v1

Mathematics

Combinatorics

Scientific paper

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-colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution. In the first part of this paper, 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-colorable subgraph. 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. 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- colorability, we found only graphs with Nullstellensatz certificates of degree four.

Affiliated with

Also associated with

No associations

Rating

Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-121774