Complete intersections in binomial and lattice ideals
complete intersectionevaluation codeslattices idealsmonomial curvesset theoretic complete intersectiontoric ideals
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Special algebraic curves and curves of low genus (14H45)
The authors study complete intersection and set theoretically complete intersection lattice ideals. The main result consists in proving that over a field of positive characteristic any graded lattice ideal of dimension 1 is set theoretically defined by binomials by using a result in [\textit{A. Katsabekis} et al., J. Algebra 324, No. 6, 1334--1346 (2010; Zbl 1207.14051)]. Also in characteristic zero they prove that for arbitary lattices a set theoretically complete intersection by binomials is in fact a complete intersection, this extends to arbitrary lattices a result in [\textit{M. Morales} and \textit{A. Thoma}, J. Algebra 284, No. 2, 755--770 (2005; Zbl 1076.13006)].
- Affine semigroup rings that are complete intersections
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
- Binomial generation of the radical of a lattice ideal
- Binomial ideals
- Cayley-Bacharach and evaluation codes on complete intersections
- Complete intersection lattice ideals
- Generators and relations of abelian semigroups and semigroup rings
- Linkage and codes on complete intersections
- On systems of binomials in the ideal of a toric variety
- On the set-theoretic complete intersection problem for monomial curves in \(\mathbb{A}^ n\) and \(\mathbb{P}^ n\)
- Reed-Muller codes on complete intersections.
- Set-theoretic complete intersections on binomials
- Sous-monoïdes d'intersection complète de N
- The Horace method for error-correcting codes
- The minimum distance of parameterized codes on projective tori
- Complete intersection lattice ideals
- Almost complete intersection binomial edge ideals and their Rees algebras
- The resultants of quadratic binomial complete intersections
- Minimal generating sets of lattice ideals
- Computing the degree of a lattice ideal of dimension one
- Set-theoretic complete intersections on binomials
- scientific article; zbMATH DE number 2186540 (Why is no real title available?)
- Veronesean almost binomial almost complete intersections
- Commutative ideal theory without finiteness conditions: Completely irreducible ideals
- Complete intersections in toric ideals
- Complete intersection vanishing ideals on degenerate tori over finite fields
- Vanishing ideals over complete multipartite graphs
- scientific article; zbMATH DE number 2046146 (Why is no real title available?)
- Regularity and algebraic properties of certain lattice ideals
- Binomial generation of the radical of a lattice ideal
- On binomial complete intersections
- On binomial set-theoretic complete intersections in characteristic \(p\)
This page was built for publication: Complete intersections in binomial and lattice ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854966)