1,037 research outputs found

    Primary Components of Binomial Ideals

    Get PDF
    Binomials are polynomials with at most two terms. A binomial ideal is an ideal generated by binomials. Primary components and associated primes of a binomial ideal are still binomial over algebraically closed fields. Primary components of general binomial ideals over algebraically closed fields with characteristic zero can be described combinatorially by translating the operations on binomial ideals to operations on exponent vectors. In this dissertation, we obtain more explicit descriptions for primary components of special binomial ideals. A feature of this work is that our results are independent of the characteristic of the field. First of all, we analyze the primary decomposition of a special class of binomial ideals, lattice ideals, in which every variable is a nonzerodivisor modulo the ideal. Then we provide a description for primary decomposition of lattice ideals in fields with positive characteristic. In addition, we study the codimension two lattice basis ideals and we compute their primary components explicitly. An ideal I ⊆ k[x_(1),….x_(n) ] is cellular if every variable is either a nonzerodivisor modulo I or is nilpotent modulo I. We characterize the minimal primary components of cellular binomial ideals explicitly. Another significant result is a computation of the Hull of a cellular binomial ideal, that is the intersection of all of its minimal primary components. Lastly, we focus on commutative monoids and their congruences. We study properties of monoids that have counterparts in the study of binomial ideals. We provide a characterization of primary ideals in positive characteristic, in terms of the congruences they induce

    Binomial Ideals and Congruences on Nn

    Get PDF
    Producción CientíficaA congruence on Nn is an equivalence relation on Nn that is compatible with the additive structure. If k is a field, and I is a binomial ideal in k[X1,…,Xn] (that is, an ideal generated by polynomials with at most two terms), then I induces a congruence on Nn by declaring u and v to be equivalent if there is a linear combination with nonzero coefficients of Xu and Xv that belongs to I. While every congruence on Nn arises this way, this is not a one-to-one correspondence, as many binomial ideals may induce the same congruence. Nevertheless, the link between a binomial ideal and its corresponding congruence is strong, and one may think of congruences as the underlying combinatorial structures of binomial ideals. In the current literature, the theories of binomial ideals and congruences on Nn are developed separately. The aim of this survey paper is to provide a detailed parallel exposition, that provides algebraic intuition for the combinatorial analysis of congruences. For the elaboration of this survey paper, we followed mainly (Kahle and Miller Algebra Number Theory 8(6):1297–1364, 2014) with an eye on Eisenbud and Sturmfels (Duke Math J 84(1):1–45, 1996) and Ojeda and Piedra Sánchez (J Symbolic Comput 30(4):383–400, 2000).National Science Foundation (grant DMS-1500832)Ministerio de Economía, Industria y Competitividad (project MTM2015-65764-C3-1)Junta de Extremadura (grupo de investigación FQM-024

    Decompositions of commutative monoid congruences and binomial ideals

    Full text link
    Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences, introduced here complete with witnesses and associated prime objects. The combinatorial theory of mesoprimary decomposition lifts to arbitrary binomial ideals in monoid algebras. The resulting binomial mesoprimary decomposition is a new type of intersection decomposition for binomial ideals that enjoys computational efficiency and independence from ground field hypotheses. Binomial primary decompositions are easily recovered from mesoprimary decomposition.Comment: 62 pages, 7 figures, v2: small improvements over v1, v3: added Problem 17.7, Corollary 4.15 and other small refinements, v4: major revision: definition of witness adjusted (Section 4), and incorrect claims concerning binomial irreducible decomposition excised (Section 15), v5: various corrections and improvements. Final version, accepted by Algebra and Number Theor
    • …
    corecore