Factorizations of the same length in abelian monoids
From MaRDI portal
Abstract: Let be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in having at least two factorizations of the same length, namely the ideal . To this end, we work with a certain (lattice) ideal associated to the monoid . Our study can be seen as a new approach generalizing cite{chapman:2011}, which only studies the case of numerical semigroups. When is a numerical semigroup we give three main results: (1) we compute explicitly a set of generators of the ideal when is minimally generated by an almost arithmetic sequence; (2) we provide an infinite family of numerical semigroups such that is a principal ideal; (3) we classify the computational problem of determining the largest integer not in as an -hard problem.
Recommendations
- The minimal generating sets of the multiplicative monoid of a finite commutative ring.
- Rees quotients of numerical semigroups.
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- Elements in a numerical semigroup with factorizations of the same length.
- Decompositions of ideals into irreducible ideals in numerical semigroups.
- On the number of factorizations of an element in an atomic monoid.
- Irreducible ideals of finitely generated commutative monoids
- On The Asymptotic Values of Length Functions In Krull And Finitely Generated commutative Monoids
- scientific article; zbMATH DE number 4194024
- Sets of lengths do not characterize numerical monoids.
Cites work
- A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings.
- Affine semigroups having a unique Betti element.
- Algebraic invariants of projective monomial curves associated to generalized arithmetic sequences
- Chains of Factorizations and Factorizations with Successive Lengths
- Complete intersections in certain affine and projective monomial curves
- Complexity of the Frobenius problem
- Computing generating sets of lattice ideals and Markov bases of lattices
- Computing toric ideals
- Elements in a numerical semigroup with factorizations of the same length.
- Factorization theory in commutative monoids
- Factorizations of the same length in numerical semigroups
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 3284302 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- Isolated factorizations and their applications in simplicial affine semigroups
- Length-factoriality in commutative monoids and integral domains
- Linear free resolutions and minimal multiplicity
- Minimal generating sets of lattice ideals
- Monomial algebras
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- On inflection points, monomial curves, and hypersurfaces containing projective curves
- On intersections of complete intersection ideals
- On the computation of the Apéry set of numerical monoids and affine semigroups
- Periodicity of Betti numbers of monomial curves
- Problems and algorithms for affine semigroups
- Properties of factorizations with successive lengths in one-dimensional local domains
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- The computation of factorization invariants for affine semigroups
- The monotone catenary degree of monoids of ideals
- The short resolution of a lattice ideal
- Toric varieties
- What can be computed in algebraic geometry?
Cited in
(5)
This page was built for publication: Factorizations of the same length in abelian monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6054806)
