Irreducible decomposition of binomial ideals
Publication
, Journal Article
Miller, E; Kahle, T; O'Neill, C
Published in: Compositio Mathematica
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct decompositions that are direct combinatorial analogues of binomial irreducible decompositions, and for binomial ideals we construct decompositions into ideals that are as irreducible as possible while remaining binomial. We provide an example of a binomial ideal that is not an intersection of irreducible binomial ideals, thus answering a question of Eisenbud and Sturmfels [1996].
Duke Scholars
Published In
Compositio Mathematica
Related Subject Headings
- General Mathematics
- 4904 Pure mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Miller, E., Kahle, T., & O’Neill, C. (n.d.). Irreducible decomposition of binomial ideals (Accepted). Compositio Mathematica.
Miller, E., T. Kahle, and C. O’Neill. “Irreducible decomposition of binomial ideals (Accepted).” Compositio Mathematica, n.d.
Miller E, Kahle T, O’Neill C. Irreducible decomposition of binomial ideals (Accepted). Compositio Mathematica.
Miller, E., et al. “Irreducible decomposition of binomial ideals (Accepted).” Compositio Mathematica.
Miller E, Kahle T, O’Neill C. Irreducible decomposition of binomial ideals (Accepted). Compositio Mathematica.
Published In
Compositio Mathematica
Related Subject Headings
- General Mathematics
- 4904 Pure mathematics
- 0101 Pure Mathematics