On the automorphisms of the power semigroups of a numerical semigroup
Pith reviewed 2026-05-07 10:25 UTC · model grok-4.3
The pith
The automorphism group of the power semigroup of any numerical semigroup is trivial.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
If H is a numerical semigroup, then the automorphism group of P(H), the semigroup of its non-empty subsets under the sumset operation, is trivial. When 0 belongs to H, the automorphism group of the submonoid P0(H) of subsets containing 0 is likewise trivial. The proofs combine combinatorial counting arguments on subsets with basic properties of semigroups.
What carries the argument
The power semigroup P(H) of non-empty subsets of H under the sumset operation, whose automorphisms are shown to reduce exactly to the identity map.
If this is right
- Any bijection of the non-empty subsets that preserves all sumsets must fix every subset.
- The addition in H is encoded so rigidly in the sumset table that no other symmetry is possible.
- The same rigidity applies directly to the monoid version P0(H) whenever 0 is present in H.
- Combinatorial arguments on finite versus infinite subsets suffice to rule out non-trivial automorphisms.
Where Pith is reading between the lines
- The result suggests that a numerical semigroup might be recoverable up to isomorphism from its power semigroup alone.
- Similar triviality could be checked for power semigroups over other cofinite monoids in the integers.
- The proof ideas might extend to show that certain sumset identities force the underlying set to be rigid.
Load-bearing premise
H is a cofinite additive submonoid of the non-negative integers.
What would settle it
Produce a numerical semigroup H and a bijection f on its non-empty subsets, other than the identity, such that f(A + B) = f(A) + f(B) holds for every pair of subsets A and B.
read the original abstract
If $H$ is a numerical semigroup (that is, a cofinite subset of the non-negative integers closed under addition), then the non-empty subsets of $H$ form a semigroup $\mathcal P(H)$ under the sumset operation induced by addition in $H$. Moreover, if $0 \in H$, then $\mathcal P(H)$ is a monoid with identity element $\{0\}$, and the family $\mathcal P_0(H)$ of all subsets of $H$ containing $0$ is a submonoid of $\mathcal P(H)$. We show that the automorphism group of $\mathcal P(H)$ is trivial, and the same holds for $\mathcal P_0(H)$ when $0 \in H$. The proofs blend ideas from combinatorics and semigroup theory.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proves that if H is a numerical semigroup, then the automorphism group of the power semigroup P(H) under sumset is trivial. It further proves that the automorphism group of the submonoid P0(H) is trivial whenever 0 belongs to H. The argument proceeds by showing that any automorphism of P(H) must preserve the collection of singletons (via a combinatorial characterization of additively indecomposable elements) and therefore induces a monoid automorphism of H; since every numerical semigroup admits only the identity automorphism, the induced map on singletons is the identity and the original automorphism is trivial. The same reduction applies to P0(H).
Significance. The result gives a complete determination of the automorphism groups of these power semigroups, linking the additive structure of numerical semigroups to the symmetries of their sumset semigroups. The manuscript supplies a self-contained combinatorial-semigroup argument that reduces the claim to the standard fact that Aut(H) is trivial for numerical semigroups; this reduction is a clear strength of the work.
minor comments (2)
- [Introduction] The introduction would benefit from a short explicit example (e.g., H = <2,3>) showing the singletons inside P(H) and confirming that the only automorphism is the identity.
- [Section 3] In the section characterizing additively indecomposable elements, the precise combinatorial criterion used to isolate singletons could be stated as a numbered lemma for easier reference in the subsequent reduction.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of the manuscript and the recommendation to accept.
Circularity Check
No significant circularity detected
full rationale
The paper establishes that any automorphism of P(H) preserves singletons via a combinatorial characterization of additively indecomposable elements under sumset, thereby inducing a monoid automorphism of the underlying numerical semigroup H. Since it is a standard, independently verifiable fact that every numerical semigroup admits only the identity automorphism (any such map fixes the minimal generator and preserves the finite gap set), the induced map is forced to be the identity. This reduction uses external combinatorial and semigroup-theoretic facts rather than self-definitional equations, fitted parameters renamed as predictions, or load-bearing self-citations. The case for P0(H) follows identically when 0 is present. No step in the provided derivation chain reduces to its own inputs by construction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption A numerical semigroup is a cofinite subset of the non-negative integers closed under addition.
Reference graph
Works this paper leans on
-
[1]
A. Aggarwal, F. Gotti, and S. Lu,On primality and atomicity of numerical power monoids, preprint (arXiv: 2412.05857)
-
[2]
A.A. Antoniou and S. Tringali,On the Arithmetic of Power Monoids and Sumsets in Cyclic Groups, Pacific J. Math. 312(2021), No. 2, 279–308
work page 2021
-
[3]
A.Assi, M.D’Anna, andP.A.García-Sánchez,Numerical semigroups and applicationsRSMESpringerSer.3, Springer, 2020 (2nd edition)
work page 2020
-
[4]
Ballieu,Sur les groupes de parties d’un demi-groupe(French), Ann
R. Ballieu,Sur les groupes de parties d’un demi-groupe(French), Ann. Soc. Sci. Bruxelles, Sér. I64(1950), 139–147
work page 1950
-
[5]
P.-Y. Bienvenu and A. Geroldinger,On algebraic properties of power monoids of numerical monoids, Israel J. Math. 265(2025), 867–900
work page 2025
-
[6]
L. Cossu and S. Tringali,On power monoids and factorization, J. Algebra686(Jan 2026), 793–813
work page 2026
- [7]
- [8]
-
[9]
P.A. García-Sánchez and S. Tringali,Semigroups of ideals and isomorphism problems, Proc. Amer. Math. Soc.153 (2025), No. 6, 2323–2339
work page 2025
-
[10]
A. Geroldinger and F. Halter-Koch,Non-unique factorizations. Algebraic, combinatorial and analytic theory, Pure Appl. Math.278, Chapman & Hall/CRC, 2006
work page 2006
-
[11]
V. Gonzalez, E. Li, H. Rabinovitz, P. Rodriguez, and M. Tirador,On the atomicity of power monoids of Puiseux monoids, Internat. J. Algebra Comput.35(2025), No. 2, 167–181
work page 2025
-
[12]
Higgins,RepresentingN-semigroups, Bull
J.C. Higgins,RepresentingN-semigroups, Bull. Austral. Math. Soc.1(1969), 115–125
work page 1969
-
[13]
Howie,Fundamentals of Semigroup Theory, London Math
J.M. Howie,Fundamentals of Semigroup Theory, London Math. Soc. Monogr. Ser.12, Oxford Univ. Press, 1995
work page 1995
- [14]
-
[15]
Nathanson,Sums of finite sets of integers, Amer
M.B. Nathanson,Sums of finite sets of integers, Amer. Math. Monthly79(1972), No. 9, 1010–1012
work page 1972
-
[16]
B. Rago,The automorphism group of reduced power monoids of finite abelian groups, preprint (arXiv:2510.17533)
-
[17]
Rago,A counterexample to an isomorphism problem for power monoids, Proc
B. Rago,A counterexample to an isomorphism problem for power monoids, Proc. Amer. Math. Soc.154(2026), 1855–1858
work page 2026
-
[18]
Shafer,Note on power semigroups, Math
J. Shafer,Note on power semigroups, Math. Japon.12(1967), 32
work page 1967
-
[19]
T. Tamura and J. Shafer,Power semigroups, Math. Japon.12(1967), 25–32;Errata, ibid.29(1984), No. 4, 679
work page 1967
-
[20]
Tringali,Power monoids and their arithmetic: a survey, preprint (https://arxiv.org/abs/2602.15754)
S. Tringali,Power monoids and their arithmetic: a survey, preprint (https://arxiv.org/abs/2602.15754)
work page internal anchor Pith review arXiv
-
[21]
On the isomorphism problem for power semigroups
S. Tringali, “On the isomorphism problem for power semigroups”, pp. 429–437 in: M. Brešar, A. Geroldinger, B. Ol- berding, and D. Smertnig (eds.),Recent Progress in Ring and Factorization Theory (Graz, Austria, July 10–14, 2023), Springer Proc. Math. Stat.477, Springer, 2025
work page 2023
-
[22]
S. Tringali and K. Wen,The automorphism group of the finitary power monoid of the integers under addition, preprint (arXiv:2504.12566)
-
[23]
S. Tringali and W. Yan,Torsion groups and the Bienvenu–Geroldinger conjecture, preprint (arXiv:2601.19592)
-
[24]
S. Tringali and W. Yan,On power monoids and their automorphisms, J. Combin. Theory Ser. A209(2025), 105961, 16 pp. 10 SalvatoreTringaliand KerouWen
work page 2025
-
[25]
S. Tringali and W. Yan,A conjecture by Bienvenu and Geroldinger on power monoids, Proc. Amer. Math. Soc.153 (2025), No. 3, 913–919
work page 2025
-
[26]
D. Wong, S. Xu, C. Zhang, and J. Zhao,On automorphism groups of numerical power semigroups, preprint (arXiv: 2512.12606). (S. Tringali) School of Mathematical Sciences, Hebei Normal University | Shijiazhuang, Hebei province, 050024 China Email address:salvo.tringali@gmail.com (K. Wen) School of Mathematical Sciences, Hebei Normal University | Shijiazhuang...
work page internal anchor Pith review arXiv
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.