Metraipolis › archive › dc_2869ce137da8
The structure of almost symmetric almost complete intersection numerical semigroups — arXiv:2609.24880
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.24880
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:54:43.655Z
- SHA-256 of the archived text
664e1a871eee60d279c934a420a700b9aa3bc9b5f58e71fbd53f0f321d536454- Stable URL of this page
https://metraipolis.com/documento/dc_2869ce137da8
How to cite
The structure of almost symmetric almost complete intersection numerical semigroups — arXiv:2609.24880 — arXiv (en), https://arxiv.org/abs/2609.24880 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2869ce137da8 (Metraipolis archive dc_2869ce137da8, sha256 664e1a871eee60d279c934a420a700b9aa3bc9b5f58e71fbd53f0f321d536454)
BibTeX
@misc{dc2869ce137da8,
title = {The structure of almost symmetric almost complete intersection numerical semigroups — arXiv:2609.24880},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.24880},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2869ce137da8; sha256 664e1a871eee60d279c934a420a700b9aa3bc9b5f58e71fbd53f0f321d536454},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24880. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove a structure theorem for numerical semigroups H that are almost symmetric and almost complete intersections. Specifically, we show that a row-factorization (RF) matrix of H must possess a highly regular structure, which we call a cascade matrix. Consequently, the defining ideal I_H of the associated semigroup ring k[H] also exhibits a highly regular structure, derived from this cascade matrix. Moreover, both the RF-matrix and the binomial minimal generating set of I_H are unique. Conversely, we show that this structure completely characterizes almost symmetric almost complete intersection numerical semigroups: to every cascade matrix M we associate a monoid H and, whenever this is a numerical semigroup, we prove that it is pseudo-symmetric, almost complete intersection, and has M as RF-matrix. As a consequence of our study, we obtain several additional key results. 1) A rigidity theorem: if an almost complete intersection semigroup is almost symmetric, then it is forced to have odd embedding dimension and to be pseudo-symmetric. This result can be regarded as the ``next step'' after Kunz's theorem, which states that an almost complete intersection semigroup is never symmetric. 2) Cascade polynomials: for each odd positive integer e, we construct a multivariate squarefree polynomial P_e with integer coefficients, arising from a cascade matrix of variables. We provide an enumerative interpretation of its coefficients, thereby proving their non-negativity. 3) Herzog--Watanabe question: en route to proving the main theorem, we prove that every minimal relation of an arbitrary numerical semigroup H can be obtained by subtracting two rows in some RF-matrix of H, affirmatively answering a 2019 question by Herzog and Watanabe. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO). Categorie arXiv: Commutative Algebra (math.AC) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.24880 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T21:26:41.195Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).