Counting Solutions to Binomial Complete Intersections

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Several minor improvements. Final version to appear in the J. of Complexity

Scientific paper

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is finite. We give a combinatorial formula for computing the total number of affine solutions (with or without multiplicity) from which we deduce that this counting problem is #P-complete. We discuss special cases in which this formula may be computed in polynomial time; in particular, this is true for generic exponent vectors.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Counting Solutions to Binomial Complete Intersections 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 Counting Solutions to Binomial Complete Intersections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Solutions to Binomial Complete Intersections will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-430548

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.