Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility

Details Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility

2008-01-24

arxiv.org/abs/0801.3788v1

Mathematics

Combinatorics

Scientific paper

Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many 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 over K. In this paper, we investigate an algorithm aimed at proving combinatorial infeasibility based on the observed low degree of Hilbert's Nullstellensatz certificates for polynomial systems arising in combinatorics and on large-scale linear-algebra computations over K. We report on experiments based on the problem of proving the non-3-colorability of graphs. We successfully solved graph problem instances having thousands of nodes and tens of thousands of edges.

Affiliated with

Also associated with

No associations

Rating

Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility 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 Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-283444