A numerical semigroup is a cofinite subsemigroup of , where is the additive monoid of non-negative integers. Denote by the semigroup consisting of all non-empty finite subsets of endowed with the operation of setwise addition defined by We call the finitary power semigroup of . When (and hence is a numerical monoid), the family of all finite subsets of containing is a submonoind of ; we call the reduced finitary power monoid of with the singleton as zero-element. For a non-empty finite subset of , we denote by and the minimum and the maximum in . Tringali and Yan have recently proved in [J.\ Combin.\ Theory Ser.\ A 209 (2025)] that the only non-trivial automorphism of is the involution . By applying Tringali-Yan’s result, we in this article determined the automorphism group of the finitary power semigroup of an arbitrary numerical semigroup . More precisely, if is the set of all integers larger than or equal to a fixed , then the only non-trivial automorphism of is the involution ; otherwise, has only the identity automorphism.

生成讲解博客的中文版本

生成AI智能校验的中文版本