Irreducible decomposition of binomial ideals

From MaRDI portal



Abstract: 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 binomial irreducible ideals, thus answering a question of Eisenbud and Sturmfels [1996].






Describes a project that uses

Uses Software






This page was built for publication: Irreducible decomposition of binomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186430)