The Delta Set of a Numerical Monoid Generated by a Generalized Arithmetic Sequence
Abstract
Let Sh=⟨ a,ah+d,ah+2d,…,ah+kd⟩, gcd(a,d)=1, 1<k<a, h> 1, be a numerical monoid generated by a generalized arithmetic sequence. In this paper, we determine the delta set Δ(Sh), resolving an open problem posed by Christopher O'Neill and Roberto Pelayo in 2014 \cite{ONeill}. Writing e=h−1 and letting E(e,d) denote the set of values arising from the subtractive Euclidean algorithm applied to e and d, we prove that Δ(Sh) = E(h−1,d)∪ {M−r(h−1):M−r(h−1)>0, r≥0}, where M=⌈a/k⌉(h−1)+d is the maximal element of Δ(Sh). In particular, d and h−1 always belong to Δ(Sh). We further establish a reduction theorem showing that Δ(Sh) is a multiple of the delta set of a primitive monoid satisfying gcd(d,h−1)=1, and deduce that the minimum delta is gcd(d,h−1). We investigate the relationship between delta sets and catenary degrees for these monoids, obtaining an explicit connection between their maximal values and formulating several conjectures concerning the catenary degree set. We also find an interesting way to generate metallic fibonacci sequences through Delta Sets. These results provide a structural description of factorization invariants for generalized arithmetic numerical monoids and suggest several directions for further study.
Related
- Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of (−1)ω(n)
- Arithmetic pseudo-Frobenius numbers and determinantal numerical semigroup rings
- Betti Sequences of Four-Generated Non-Almost-Symmetric Nearly Gorenstein Numerical Semigroup Rings
- Numerical invariants for three-generated ideals
- Asymptotic and Arithmetic Aspects of Generalized Colored Overpartitions
BibTeX
@misc{narayan2026delta,
title = {{The Delta Set of a Numerical Monoid Generated by a Generalized Arithmetic Sequence}},
author = {Ashwin Narayan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.02495},
eprint = {2610.02495},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.02495},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - The Delta Set of a Numerical Monoid Generated by a Generalized Arithmetic Sequence
AU - Ashwin Narayan
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.02495
UR - https://arxiv.org/abs/2610.02495
AB - Let S_h=⟨ a,ah+d,ah+2d,…,ah+kd⟩, gcd(a,d)=1, 1<k<a, h> 1, be a numerical monoid generated by a generalized arithmetic sequence. In this paper, we determine the delta set Δ(S_h), resolving an open problem posed by Christopher O'Neill and Roberto Pelayo in 2014 \cite{ONeill}. Writing e=h−1 and letting E(e,d) denote the set of values arising from the subtractive Euclidean algorithm applied to e and d, we prove that Δ(S_h) = E(h−1,d)∪ {M−r(h−1):M−r(h−1)>0, r≥0}, where M=⌈a/k⌉(h−1)+d is the maximal element of Δ(S_h). In particular, d and h−1 always belong to Δ(S_h). We further establish a reduction theorem showing that Δ(S_h) is a multiple of the delta set of a primitive monoid satisfying gcd(d,h−1)=1, and deduce that the minimum delta is gcd(d,h−1). We investigate the relationship between delta sets and catenary degrees for these monoids, obtaining an explicit connection between their maximal values and formulating several conjectures concerning the catenary degree set. We also find an interesting way to generate metallic fibonacci sequences through Delta Sets. These results provide a structural description of factorization invariants for generalized arithmetic numerical monoids and suggest several directions for further study.
ER -