Computation of delta sets of numerical monoids.

DOI10.1007/S00605-015-0785-9MaRDI QIDQ889031zbMATH OpenOpenAlexFDO

Authors M. A. Moreno-Frías, J. I. García-García, A. Vigneron-Tenorio

Publication date 6 November 2015

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.0280

zbMATH Keywords

algorithmsdelta setslengths of factorizationsnon-unique factorizationsnumerical monoidsnumerical semigroupssets of generators

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Free semigroups, generators and relations, word problems (20M05) Arithmetic theory of semigroups (20M13) Commutative semigroups (20M14)

Abstract: Let $a_1,dots,a_p$ be the minimal generating set of a numerical monoid $S$. For any $sinS$, its Delta set is defined by $Delta(s)=l_i-l_{i-1}|i=2,dots,k$ where $l_1<dots<l_k$ is the set $su{m}_{i=1}^p{x}_i,|,s=su{m}_{i=1}^p{x}_i{a}_{i}extrmand{x}_{i}inNextrmforalli.$ The Delta set of $S$, denoted by $Delta(S)$, is the union of all the sets $Delta(s)$ with $sinS.$ As proved in [S.T. Chapman, R. Hoyer, and N. Kaplan. Delta sets of numerical monoids are eventually periodic. Aequationes Math. 77 (2009), no. 3, 273--279], there exists a bound $N$ such that $Delta(S)$ is the union of the sets $Delta(s)$ with $sinS$ and $s<N$. In this work, by using geometrical tools, we obtain a sharpened bound and we give an algorithm to compute $Delta(S)$ from the factorizations of only $a_1$ elements.

Review text

A numerical monoid \(S\) is an additive submonoid of the natural numbers with finite complement. Each \(S\) has a unique minimal generating set \(\{a_1,\ldots,a_p\}\) with \(a_1<a_2<\cdots<a_p\) such that \(S\) is the set of linear combinations of elements from this set with nonnegative coefficients. The Delta set of an element \(s\in S\), denoted \(\Delta(s)\), is the set of differences between consecutive elements in the set of factorization lengths of \(s\). The Delta set of \(S\) is defined by \(\Delta(S)=\bigcup_{s\in S}\Delta(s)\). It is known that \(\Delta(S)\) is finite and that every element of \(\Delta(S)\) already occurs in some \(\Delta(s)\) where \(s\) is not `too large'. Theorem 1 in [\textit{S. T. Chapman, R. Hoyer}, and \textit{N. Kaplan}, Aequationes Math. 77, No. 3, 273-279 (2009; Zbl 1204.20078)] says that \(\Delta(S)\) is the union of \(\Delta(s)\) taken over all \(s<2pa_2a_p^2+a_1a_p\). The main result of this paper is to greatly improve this bound (Corollary 19) and to give a fast algorithm for computing \(\Delta(S)\). This algorithm has been implemented and is publicly available. Instead of needing to compute all factorizations of all small elements of \(S\), this paper shows that one need only compute the complete set of factorizations for a particular set of \(a_1\) elements and that Delta sets of the smaller elements can be deduced from these. \textit{A. Geroldinger}'s structure theorem for sets of lengths [Colloq. Math. 78, No. 2, 225-259 (1998; Zbl 0926.11082)], shows that the set of factorization lengths of \(s\in S\) consists of three pieces, where the middle piece is an arithmetic progression, so that all the interesting elements in \(\Delta(s)\) come from the long and short factorizations. The proofs in this article progress along the same lines. The authors divide the set of factorizations into three pieces and show that the factorization lengths in the middle piece form an arithmetic progression (Definition 15 and Theorem 16). They describe how the set of `long factorizations' of \(s\) and of \(s+a_1\) and the set of `short factorizations' for \(s\) and \(s+a_p\) are related for \(s\) sufficiently large (Theorem 18), which leads to the proof of the main result.

Recommendations

• ON DELTA SETS OF NUMERICAL MONOIDS
• Shifts of generators and delta sets of numerical monoids.
• Delta sets of numerical monoids using nonminimal sets of generators.
• Delta sets of numerical monoids are eventually periodic.
• Delta sets for nonsymmetric numerical semigroups with embedding dimension three

Cites work

• Arithmetical semigroups defined by congruences
• Delta sets of numerical monoids are eventually periodic.
• Delta sets of numerical monoids using nonminimal sets of generators.
• Efficient solution of linear diophantine equations
• Factorization properties of Leamer monoids.
• scientific article; zbMATH DE number 1438385 (Why is no real title available?)
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• Numerical semigroups.
• ON DELTA SETS OF NUMERICAL MONOIDS
• On the arithmetic of certain not integrally closed noetheian integral domains
• On the delta set and the Betti elements of a BF-monoid.
• On the delta set of a singular arithmetical congruence monoid.
• Shifts of generators and delta sets of numerical monoids.

Cited in

(28)

• On the delta set of a singular arithmetical congruence monoid.
• Power monoids: a bridge between factorization theory and arithmetic combinatorics
• Delta sets for nonsymmetric numerical semigroups with embedding dimension three
• On divisor-closed submonoids and minimal distances in finitely generated monoids
• Apéry sets of shifted numerical monoids
• A realization theorem for sets of lengths in numerical monoids
• On the delta set and the Betti elements of a BF-monoid.
• On factorization invariants and Hilbert functions
• On length densities
• On strongly primary monoids, with a focus on Puiseux monoids
• Factorization theory in commutative monoids
• Delta sets for symmetric numerical semigroups with embedding dimension three
• Sets of arithmetical invariants in transfer Krull monoids
• On minimum delta set values in block monoids over cyclic groups.
• Length density and numerical semigroups
• Shifts of generators and delta sets of numerical monoids.
• Factorization invariants in numerical monoids
• On dynamic algorithms for factorization invariants in numerical monoids
• ON DELTA SETS OF NUMERICAL MONOIDS
• Delta sets of numerical monoids using nonminimal sets of generators.
• Factoring in the Chicken McNugget monoid
• Distances between factorizations in the Chicken McNugget monoid
• Factorizations of the same length in numerical semigroups
• Algorithms for calculating the set of integers contained in a monoid finitely generated by positive rational numbers
• Beyond Coins, Stamps, and Chicken McNuggets: An Invitation to Numerical Semigroups
• Which sets are sets of lengths in all numerical monoids?
• Delta sets of numerical monoids are eventually periodic.
• The structure theorem for sets of lengths for numerical semigroups

Describes a project that uses

Uses Software

• DeltaSetsNumericalMonoids

This page was built for publication: Computation of delta sets of numerical monoids.

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