pith. sign in

arxiv: 2604.26901 · v1 · submitted 2026-04-29 · 🧮 math.NT · math.CO· math.RA

On the automorphisms of the power semigroups of a numerical semigroup

Pith reviewed 2026-05-07 10:25 UTC · model grok-4.3

classification 🧮 math.NT math.COmath.RA
keywords numerical semigroupspower semigroupsautomorphism groupssumset operationtrivial automorphismsadditive monoids
0
0 comments X

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.

A numerical semigroup is a cofinite additive submonoid of the non-negative integers. The power semigroup P(H) is the collection of all its non-empty subsets equipped with the sumset operation. The paper proves that the only automorphism of this semigroup is the identity map. The same conclusion holds for the submonoid P0(H) of subsets containing zero, whenever zero lies in H. This establishes that the sumset structure on subsets admits no non-trivial rearrangements that preserve the operation.

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

These are editorial extensions of the paper, not claims the author makes directly.

  • 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.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

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)
  1. [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.
  2. [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

0 responses · 0 unresolved

We thank the referee for the positive assessment of the manuscript and the recommendation to accept.

Circularity Check

0 steps flagged

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

0 free parameters · 1 axioms · 0 invented entities

The paper rests on the standard definition of numerical semigroups and the induced sumset operation; no free parameters, invented entities, or non-standard axioms are introduced in the abstract.

axioms (1)
  • domain assumption A numerical semigroup is a cofinite subset of the non-negative integers closed under addition.
    This is the foundational definition used to construct P(H) and P0(H).

pith-pipeline@v0.9.0 · 5432 in / 1120 out tokens · 40952 ms · 2026-05-07T10:25:26.056063+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages · 2 internal anchors

  1. [1]

    Aggarwal, F

    A. Aggarwal, F. Gotti, and S. Lu,On primality and atomicity of numerical power monoids, preprint (arXiv: 2412.05857)

  2. [2]

    Antoniou and S

    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

  3. [3]

    A.Assi, M.D’Anna, andP.A.García-Sánchez,Numerical semigroups and applicationsRSMESpringerSer.3, Springer, 2020 (2nd edition)

  4. [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

  5. [5]

    Bienvenu and A

    P.-Y. Bienvenu and A. Geroldinger,On algebraic properties of power monoids of numerical monoids, Israel J. Math. 265(2025), 867–900

  6. [6]

    Cossu and S

    L. Cossu and S. Tringali,On power monoids and factorization, J. Algebra686(Jan 2026), 793–813

  7. [7]

    J. Dani, F. Gotti, L. Hong, B. Li, and S. Schlessinger,On finitary power monoids of linearly orderable monoids, preprint (arXiv:2501.03407)

  8. [8]

    Fan and S

    Y. Fan and S. Tringali,Power monoids: A bridge between Factorization Theory and Arithmetic Combinatorics, J. Algebra512(Oct. 2018), 252–294

  9. [9]

    García-Sánchez and S

    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

  10. [10]

    Geroldinger and F

    A. Geroldinger and F. Halter-Koch,Non-unique factorizations. Algebraic, combinatorial and analytic theory, Pure Appl. Math.278, Chapman & Hall/CRC, 2006

  11. [11]

    Gonzalez, E

    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

  12. [12]

    Higgins,RepresentingN-semigroups, Bull

    J.C. Higgins,RepresentingN-semigroups, Bull. Austral. Math. Soc.1(1969), 115–125

  13. [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

  14. [14]

    Li and S

    L. Li and S. Tringali,On global isomorphisms and a closure property of semigroups, preprint (arXiv:2510.00772)

  15. [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

  16. [16]

    Rago,The automorphism group of reduced power monoids of finite abelian groups, preprint (arXiv:2510.17533)

    B. Rago,The automorphism group of reduced power monoids of finite abelian groups, preprint (arXiv:2510.17533)

  17. [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

  18. [18]

    Shafer,Note on power semigroups, Math

    J. Shafer,Note on power semigroups, Math. Japon.12(1967), 32

  19. [19]

    Tamura and J

    T. Tamura and J. Shafer,Power semigroups, Math. Japon.12(1967), 25–32;Errata, ibid.29(1984), No. 4, 679

  20. [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)

  21. [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

  22. [22]

    Tringali and K

    S. Tringali and K. Wen,The automorphism group of the finitary power monoid of the integers under addition, preprint (arXiv:2504.12566)

  23. [23]

    Tringali and W

    S. Tringali and W. Yan,Torsion groups and the Bienvenu–Geroldinger conjecture, preprint (arXiv:2601.19592)

  24. [24]

    Tringali and W

    S. Tringali and W. Yan,On power monoids and their automorphisms, J. Combin. Theory Ser. A209(2025), 105961, 16 pp. 10 SalvatoreTringaliand KerouWen

  25. [25]

    Tringali and W

    S. Tringali and W. Yan,A conjecture by Bienvenu and Geroldinger on power monoids, Proc. Amer. Math. Soc.153 (2025), No. 3, 913–919

  26. [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...