Complete intersection lattice ideals
From MaRDI portal
Abstract: In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of with no invertible elements, where is a finite abelian group. We also characterize the lattice ideals that are set-theoretic complete intersections on binomials.
Recommendations
- Commutative ideal theory without finiteness conditions: Completely irreducible ideals
- Affine semigroup rings that are complete intersections
- Minimal generating sets of lattice ideals
- Complete intersections in binomial and lattice ideals
- Construction of set theoretic complete intersections via semigroup gluing
- On complete intersection affine semigroups
- The lattice of ideals of some ordered semigroups
- The relations of semiadjacency and semicompatibility in \(\cap\)-semigroups of transformations.
- The intersection of the maximal regular subsemigroups of the semigroup of binary relations
- Subalgebra lattices of completely simple semigroups
Cites work
- Affine semigroup rings that are complete intersections
- Affine torus embeddings which are complete intersections
- Binomial arithmetical rank of lattice ideals
- Binomial ideals
- Generators and relations of abelian semigroups and semigroup rings
- scientific article; zbMATH DE number 2046146 (Why is no real title available?)
- Mixed matrices and binomial ideals
- On complete intersection affine semigroups
- On presentations of subsemigroups of \(\mathbb{N}^n\)
- On regular sequences of binomials
- On systems of binomials in the ideal of a toric variety
- On the equations defining toric l.c.i.-singularities
- Radicals of binomial ideals
- Relative invariants of finite groups generated by pseudoreflections
- Set-theoretic complete intersections in characteristic 𝑝
- Set-theoretic complete intersections on binomials
- Sous-monoïdes d'intersection complète de N
Cited in
(28)- Toric codes and lattice ideals
- Chomp on numerical semigroups
- Mixed matrices and binomial ideals
- On toric ideals arising from signed graphs
- Cayley posets
- On monomial curves obtained by gluing
- When the associated graded ring of a semigroup ring is complete intersection
- Minimal generating sets of lattice ideals
- Computing the degree of a lattice ideal of dimension one
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
- Set-theoretic complete intersection lattice ideals in monoid rings
- Complete intersections in binomial and lattice ideals
- Graphs and complete intersection toric ideals
- Commutative ideal theory without finiteness conditions: Completely irreducible ideals
- Ring graphs and toric ideals
- Producing set-theoretic complete intersection monomial curves in ℙⁿ
- Gluing and Hilbert functions of monomial curves
- On complete intersection toric ideals of graphs
- Affine semigroup rings that are complete intersections
- Complete intersections in simplicial toric varieties
- Regularity and algebraic properties of certain lattice ideals
- CIO and ring graphs: deficiency and testing
- Lattice ideals, semigroups and toric codes
- Rational points of lattice ideals on a toric variety and toric codes
- On parameterized toric codes
- Binomial generation of the radical of a lattice ideal
- Distance reducing Markov bases
- Ring graphs and complete intersection toric ideals
This page was built for publication: Complete intersection lattice ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770456)
