The Frobenius number of Dao's cyclic semigroups

Fix n ≥ 2 and positive integers a1, …, an, indices modulo n, and put xi = 1 + ai + aiai+1 + ⋯ + aiai+1⋯ai+n−2. Hailong Dao asked on MathOverflow (question 292507) whether the numerical semigroup ⟨x1, …, xn⟩ has Frobenius number (n−1)(a1⋯an − 1). We prove this for every coprime list, by a mixed-radix (carrying) description of each residue class. The case n = 3 is due to Herzog, Hibi and Stamate. Combined with a theorem of Goto, Kien, Matsuoka and Truong, the result gives, for n ≥ 3 and minimal generators, the pseudo-Frobenius numbers N, 2N, …, (n−1)N (N = a1⋯an − 1), almost symmetry, and a presentation by the 2 × 2 minors of a cyclic monomial matrix. The main theorem is formally verified in Lean 4; the corollary rests on the cited theorem. This record is identical to the folder dao-cyclic-frobenius at tag dao-cyclic-frobenius-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (23 October 2026) was released on GitHub only.

Authors

Publication Details

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

The Frobenius number of Dao's cyclic semigroups

Vamshi Jandhyala
Zenodo (CERN European Organization for Nuclear Research)
Commutative Algebra and Its Applications
preprint

The Frobenius number of Dao's cyclic semigroups

Vamshi Jandhyala
preprint en

Abstract

Fix n ≥ 2 and positive integers a1, …, an, indices modulo n, and put xi = 1 + ai + aiai+1 + ⋯ + aiai+1⋯ai+n−2. Hailong Dao asked on MathOverflow (question 292507) whether the numerical semigroup ⟨x1, …, xn⟩ has Frobenius number (n−1)(a1⋯an − 1). We prove this for every coprime list, by a mixed-radix (carrying) description of each residue class. The case n = 3 is due to Herzog, Hibi and Stamate. Combined with a theorem of Goto, Kien, Matsuoka and Truong, the result gives, for n ≥ 3 and minimal generators, the pseudo-Frobenius numbers N, 2N, …, (n−1)N (N = a1⋯an − 1), almost symmetry, and a presentation by the 2 × 2 minors of a cyclic monomial matrix. The main theorem is formally verified in Lean 4; the corollary rests on the cited theorem. This record is identical to the folder dao-cyclic-frobenius at tag dao-cyclic-frobenius-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (23 October 2026) was released on GitHub only.

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