Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-10T04:21:44.014Z Has data issue: false hasContentIssue false

Irreducible decomposition of binomial ideals

Published online by Cambridge University Press:  01 April 2016

Thomas Kahle
Affiliation:
Faculty of Mathematics, Otto-von-Guericke Universität, Magdeburg, Germany email thomas.kahle@ovgu.de
Ezra Miller
Affiliation:
Mathematics Department, Duke University, Durham, NC 27708, USA email ezra@math.duke.edu
Christopher O’Neill
Affiliation:
Mathematics Department, Texas A&M University, TX 77843, USA email coneill@math.tamu.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Building on coprincipal mesoprimary decomposition [Kahle and Miller, Decompositions of commutative monoid congruences and binomial ideals, Algebra and Number Theory 8 (2014), 1297–1364], 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 [Binomial ideals, Duke Math. J. 84 (1996), 1–45].

Information

Type
Research Article
Copyright
© The Authors 2016