Searcharxiv⌕ Search

arXiv · 2611.13956

Automorphisms of the Reduced Finitary Power Monoid of $\N^d$

Abstract

Given an additive semigroup $S$, the collection of its nonempty finite subsets can be equipped with the setwise addition \[ X + Y = \{x + y : x \in X, \; y \in Y\}, \] forming a semigroup denoted by $\mathcal{P}_{\mathrm{fin}}(S)$, which is called the finitary power semigroup of $S$. If $S$ is a monoid with identity $0$, the finite nonempty subsets containing $0$ form a submonoid $\mathcal{P}_{\mathrm{fin},0}(S)$, known as the reduced finitary power monoid, whose identity element is the singleton $\{0\}$. Let $d$ be a positive integer, $\mathbb{N}$ the set of nonnegative integers, and $\mathbb{N}^d = \{(a_1, a_2, \dots, a_d) \mid a_i \in \mathbb{N}\}$. For the one-dimensional case \(d=1\), Tringali and Yan (\textit{J. Comb. Theory, Ser. A}, \textbf{209} (2025)) established that the only nontrivial automorphism of $\mathcal{P}_{\mathrm{fin},0}(\mathbb{N})$ is the involution $X \mapsto \max X - X$. In this paper, we focus on the higher-dimensional case $d \ge 2$. We prove that $\operatorname{Aut}(\mathcal{P}_{\mathrm{fin},0}(\mathbb{N}^d)) \cong S_d$, meaning that every automorphism is inner, induced by a permutation of the coordinate directions. This reveals a sharp contrast with the one-dimensional setting, where non-inner symmetries exist.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Songnian Xu, Dein Wong. 2026-11-10. Automorphisms of the Reduced Finitary Power Monoid of $\N^d$. https://searcharxiv.com/abs/2611.13956

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗