Cellular binomial ideals. Primary decomposition of binomial ideals
In addition to the work of \textit{D. Eisenbud} and \textit{B. Sturmfels} [Duke Math. J. 84, 1-45 (1996; Zbl 0873.13021)], the authors present more detailed algorithms for the binomial primary decomposition of a binomial ideal in the ring of polynomials \(K[x_1,x_2, \dots,x_n]\) over an algebraically closed field \(K\). In so doing, decompositions into cellular binomial ideals (different from the ones given in the paper cited above) and after that (in the case of positive characteristic) into unmixed cellular binomial ideals are used. The corresponding algorithms are written out and some examples are presented.
- Decompositions of cellular binomial ideals
- Binomial canonical decompositions of binomial ideals
- Irreducible decomposition of binomial ideals
- scientific article; zbMATH DE number 1532176
- scientific article; zbMATH DE number 589392
- Primary decomposition of ideals of lattice homomorphisms
- scientific article; zbMATH DE number 1532177
- Primary decomposition of lattice basis ideals
- A Natural Modes Model and Modal Identities for Damped Linear Structures
- Binomial ideals
- Direct methods for primary decomposition
- Gröbner bases and primary decomposition of polynomial ideals
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- Localization and primary decomposition of polynomial ideals
- Some algebraic aspects of mesoprimary decomposition
- Binomial difference ideals
- Index of nilpotency of binomial ideals.
- Minimal resolutions of lattice ideals and integer linear programming
- Standard pairs for monomial ideals in semigroup rings
- Combinatorics of binomial primary decomposition
- Computing lattice ideals of unions of monomial curves
- Decompositions of cellular binomial ideals
- Theory and applications of lattice point methods for binomial ideals
- Primary decompositions with sections on Macaulay2 and networks
- Binomial canonical decompositions of binomial ideals
- Irreducible decomposition of binomial ideals
- On monomial reduction and polynomial expressions with respect to binomial ideals
- The join-meet ideal of a finite lattice
- Binomial ideals and congruences on \(\mathbb {N}^n\)
- Corrigendum: Decompositions of cellular binomial ideals
- Critical binomial ideals of Northcott type
- An algorithm for computing minimal associated primes of binomial ideals without producing redundant components
- Mesoprimary decomposition of binomial submodules
- Eigenschemes and the Jordan canonical form
- Computing the binomial part of a polynomial ideal
- Binomial ideals attached to finite collections of cells
- On the symmetric and Rees algebras of some binomial ideals
This page was built for publication: Cellular binomial ideals. Primary decomposition of binomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1588029)
