Decompositions of cellular binomial ideals
Structure, classification theorems for modules and ideals in commutative rings (13C05) Arithmetic rings and other special commutative rings (13F99) Computational aspects and applications of commutative rings (13P99) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)
The paper deals with cellular binomial ideals, a certain class of binomial ideals with much simpler combinatorics than that of general binomial ideals. The authors argue that cellular ideals strike just the right balance between computability and combinatorial clarity. Decompositions of arbitrary binomial ideals into cellular binomial ideals exist (and are the same) over any coefficient field, although many choices have to be made in their computation so that cellular components are very far from canonical.NEWLINENEWLINEThe paper describes very explicitly the hull (the intersection over the primary components of minimal primes) and various decompositions of a cellular binomial ideal. The description of the hull is much nicer than the one given by \textit{D. Eisenbud} and \textit{B. Sturmfels} [Duke Math. J. 84, No. 1, 1--45 (1996; Zbl 0873.13021)] as only a monomial ideal needs to be added instead of complicated colons modulo binomials. As the authors argue, this has important ramifications for computations with binomial ideals. A particular feature of the results in this paper is that they are mostly independent of the characteristic of the base field. Finding such unifying results is hard as can be seen from the technicalities in [loc. cit.] and [\textit{T. Kahle} and \textit{E. Miller}, Algebra Number Theory 8, No. 6, 1297--1364 (2014; Zbl 1341.20062)].NEWLINENEWLINETheorem 2.11. in this paper solves one of the problems in [Eisenbud and Sturmfels, loc. cit.] which had remained open for almost 20 years: a decomposition of a cellular binomial ideal as a finite intersection of unmixed cellular binomial ideals in arbitrary characteristic.
- Cellular binomial ideals. Primary decomposition of binomial ideals
- An algorithm for computing minimal associated primes of binomial ideals without producing redundant components
- Binomial canonical decompositions of binomial ideals
- Irreducible decomposition of binomial ideals
- Some algebraic aspects of mesoprimary decomposition
- A divide and conquer method to compute binomial ideals
- Combinatorics of binomial primary decomposition
- Decompositions of commutative monoid congruences and binomial ideals.
- Binomial edge ideals and conditional independence statements
- Binomial ideals
- Cellular binomial ideals. Primary decomposition of binomial ideals
- Combinatorics and commutative algebra
- Combinatorics of binomial primary decomposition
- Decompositions of commutative monoid congruences and binomial ideals.
- scientific article; zbMATH DE number 2190625 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Lattice point methods for combinatorial games
- Lectures on algebraic statistics
- Siphons in chemical reaction networks
- The effect on associated prime ideals produced by an extension of the base field.
- The prime ideals of a polynomial ideal under extension of the base field
- Theory and applications of lattice point methods for binomial ideals
- Cellular binomial ideals. Primary decomposition of binomial ideals
- Some algebraic aspects of mesoprimary decomposition
- Standard pairs for monomial ideals in semigroup rings
- Combinatorics of binomial primary decomposition
- Binomial canonical decompositions of binomial ideals
- Irreducible decomposition of binomial ideals
- On piecewise linear cell decompositions
- [[:Publication:4289377|Décomposition cellulaire de variétés paramétrant des idéaux homogènes de C x,y. Incidence des cellules - II -.]]
- Binomial ideals and congruences on \(\mathbb {N}^n\)
- Corrigendum: Decompositions of cellular binomial ideals
- Cellular reductions of the Pommaret-Seiler resolution for Quasi-stable ideals
- An algorithm for computing minimal associated primes of binomial ideals without producing redundant components
- Binomial ideals attached to finite collections of cells
- Cellular resolutions of cointerval ideals
This page was built for publication: Decompositions of cellular binomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835327)
