Counting solutions to binomial complete intersections
From MaRDI portal
Publication:870342
DOI10.1016/j.jco.2006.04.004zbMath1112.13028arXivmath/0510520OpenAlexW2172194430MaRDI QIDQ870342
Alicia Dickenstein, Eduardo H. Cattani
Publication date: 12 March 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0510520
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Complete intersections (14M10) Computational aspects in algebraic geometry (14Q99)
Related Items (5)
INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE ⋮ Systems of equations with a single solution ⋮ Binomial \(D\)-modules ⋮ Combinatorics of binomial primary decomposition ⋮ On the multiplicity of isolated roots of sparse polynomial systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On regular sequences of binomials
- Mixed dominating matrices
- Primary decomposition of lattice basis ideals
- Mixed matrices and binomial ideals
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Elimination theory in codimension 2
- Binomial ideals
- Gröbner deformations of hypergeometric differential equations
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- On simplicial toric varieties which are set-theoretic complete intersections
- Generators and relations of abelian semigroups and semigroup rings
- Bivariate hypergeometric \(D\)-modules
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Complete intersections in toric ideals
- The Complexity of Enumeration and Reliability Problems
- Sous-monoïdes d'intersection complète de $N$
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- Affine semigroup rings that are complete intersections
- What can be computed in algebraic geometry?
- Depth-First Search and Linear Graph Algorithms
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
This page was built for publication: Counting solutions to binomial complete intersections
