Counting Solutions to Binomial Complete Intersections
Eduardo Cattani, Alicia Dickenstein
Abstract
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.
Create a lesson
Related papers
A Relative Telescope-Type Conjecture: Support and Generation in Half-Bounded Derived Categories
Liangyu Zhu
Associated primes in group cohomology and a strange result
James A. Schafer
Minimal cellular resolutions of complementary edge ideals
Somayeh Moradi
On a question of Takahashi concerning direct summands of syzygies
Luigi Ferraro
On Bayart's unique factorization problem
Elad Paran
Parameters and lim CM sequences: the Q-sequence conjecture and Lech's formula
Mel Hochster, Olivia Strahan