Counting solutions to binomial complete intersections (Q870342): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Eduardo H. Cattani / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Paolo Valabrega / rank
Normal rank
 
Property / author
 
Property / author: Eduardo H. Cattani / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Paolo Valabrega / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SINGULAR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172194430 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0510520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simplicial toric varieties which are set-theoretic complete intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: What can be computed in algebraic geometry? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete intersections in toric ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sous-monoïdes d'intersection complète de $N$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bivariate hypergeometric \(D\)-modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination theory in codimension 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine semigroup rings that are complete intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed dominating matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed matrices and binomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generators and relations of abelian semigroups and semigroup rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primary decomposition of lattice basis ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner deformations of hypergeometric differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular sequences of binomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4781203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Revision as of 14:52, 25 June 2024

scientific article
Language Label Description Also known as
English
Counting solutions to binomial complete intersections
scientific article

    Statements

    Counting solutions to binomial complete intersections (English)
    0 references
    0 references
    0 references
    12 March 2007
    0 references
    The paper studies binomial ideals in the polynomial ring in \(n\) variables over a field \(k\) of characteristic \(0\), i.e. ideals generated by a set of binomials \(p_j(x) = x^\alpha_j-c_jx^\beta_j,\alpha\) and \(\beta\) being \(n\)-tuples of integers. The main concern of the paper is deciding whether such an ideal has finitely many zeros (and at least one) in the algebraic closure \(\bar k\), which means that the corresponding variety is a complete intersection. This is done by using the matrix \(B= \left(\begin{smallmatrix} \alpha_1-\beta_1&\\ \cdots\\ \alpha_n-\beta_n \end{smallmatrix}\right)\). In particular, when \(\det(B) = 0\) it is necessary to introduce and discuss the notion of generic complete intersection (g.c.i.): the \(p_j(x)\) form a g.c.i. when the corresponding variety is a complete intersection for a generic choice of the coefficients \(c_j\). The paper then gives conditions that force the binomial ideal to be a g.c.i. One section of the paper is devoted to complexity questions, in particular to the problem of counting the number of zeros in polynomial and not exponential time.
    0 references
    binomial ideals
    0 references
    complete intersections
    0 references
    zero dimensional schemes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references