Counting Solutions to Binomial Complete Intersections
| dc.creator | Cattani, Eduardo | |
| dc.creator | Dickenstein, Alicia | |
| dc.date | 2005-10-25 | |
| dc.date | 2006-04-27 | |
| dc.date.accessioned | 2026-07-07T06:47:52Z | |
| dc.date.available | 2026-07-07T06:47:52Z | |
| dc.description | 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. | |
| dc.description | Several minor improvements. Final version to appear in the J. of Complexity | |
| dc.identifier | https://arxiv.org/abs/math/0510520 | |
| dc.identifier | http://arxiv.org/abs/math/0510520 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/103794 | |
| dc.subject | Commutative Algebra | |
| dc.subject | Computational Complexity | |
| dc.subject | Combinatorics | |
| dc.title | Counting Solutions to Binomial Complete Intersections | |
| dc.type | text |