Extremal relations and Betti numbers of four-generated numerical semigroups

For numerical semigroups minimally generated by four integers, the largest cardinality of a minimal presentation at multiplicity m ≥ 4 is T(m) = 2 + floor(sqrt(4m)). The upper bound counts minimal excluded exponent vectors of the canonical Apéry downset. Published constructions give attainment and the complete attainable spectrum, proving Conjecture 7.1 of Elmacıoğlu, Hilmer, O’Neill, Okandan and Park-Kaufmann. The paper bounds the maximal type and second total Betti number within intervals of length two and characterizes equality with the Macaulay presentation bound. The Elias–Geramita–Valla bound on the maximal type is strict for every m ≥ 32, confirming the four-generator case of a conjecture of Moscariello and Sammartano. Version 4 (R18) is the 28-page preprint. This revision gives the direct combinatorial proof of the staircase socle bound, clarifies the finite certificates, and includes Lean statement excerpts. The two appendix statements were replayed using Lean 4.34.0-rc1 with the pinned dependencies and receipt-matched project outputs. The companion software archive is version 0.2.0. The manuscript’s Declarations specify the contributions of ChatGPT, Codex, Claude Opus 5.5 and Gemini. The author takes responsibility for the mathematical claims, attribution and final text. The manuscript and TeX source are licensed under CC BY 4.0, and original companion code is licensed under Apache 2.0.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24346040
Primary Topic
Commutative Algebra and Its Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Extremal relations and Betti numbers of four-generated numerical semigroups

Keisuke Sato
1 links
Zenodo (CERN European Organization for Nuclear Research)
Commutative Algebra and Its Applications
preprint

Extremal relations and Betti numbers of four-generated numerical semigroups

Keisuke Sato
preprint en

Abstract

For numerical semigroups minimally generated by four integers, the largest cardinality of a minimal presentation at multiplicity m ≥ 4 is T(m) = 2 + floor(sqrt(4m)). The upper bound counts minimal excluded exponent vectors of the canonical Apéry downset. Published constructions give attainment and the complete attainable spectrum, proving Conjecture 7.1 of Elmacıoğlu, Hilmer, O’Neill, Okandan and Park-Kaufmann. The paper bounds the maximal type and second total Betti number within intervals of length two and characterizes equality with the Macaulay presentation bound. The Elias–Geramita–Valla bound on the maximal type is strict for every m ≥ 32, confirming the four-generator case of a conjecture of Moscariello and Sammartano. Version 4 (R18) is the 28-page preprint. This revision gives the direct combinatorial proof of the staircase socle bound, clarifies the finite certificates, and includes Lean statement excerpts. The two appendix statements were replayed using Lean 4.34.0-rc1 with the pinned dependencies and receipt-matched project outputs. The companion software archive is version 0.2.0. The manuscript’s Declarations specify the contributions of ChatGPT, Codex, Claude Opus 5.5 and Gemini. The author takes responsibility for the mathematical claims, attribution and final text. The manuscript and TeX source are licensed under CC BY 4.0, and original companion code is licensed under Apache 2.0.

Zenodo (CERN European Organization for Nuclear Research)
Commutative Algebra and Its Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon