Search arXivSearch

arXiv · 2504.12566

The Automorphism Group of the Finitary Power Monoid of the Integers under Addition

Abstract

Endowed with the binary operation of set addition carried over from the integers, the family $\mathcal P_{\mathrm{fin}}(\mathbb Z) $ of all non-empty finite subsets of $\mathbb Z$ forms a monoid whose neutral element is the singleton $\{0\}$. Building upon recent work by Tringali and Yan, we determine the automorphisms of $\mathcal P_{\mathrm{fin}}(\mathbb Z)$. In particular, we find that the automorphism group of $\mathcal P_{\mathrm{fin}}(\mathbb Z)$ is isomorphic to the direct product of a cyclic group of order two by the infinite dihedral group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Salvatore Tringali, Kerou Wen. 2025-04-17. The Automorphism Group of the Finitary Power Monoid of the Integers under Addition. https://arxiv.org/abs/2504.12566

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO