Searcharxiv⌕ Search

arXiv · 2611.10645

Automorphism of reduced finitary power monoids

Abstract

Let $H$ be a multiplicatively written monoid with identity element $1_H$. The family $\mathcal{P}_{\mathrm{fin},1}(H)$ of all finite subsets of $H$ containing $1_H$ is a monoid with identity $\{1_H\}$ under the setwise multiplication induced by $H$. We prove that $\operatorname{Aut}(\mathcal{P}_{\mathrm{fin},1}(H)) \cong \operatorname{Aut}(H)$ whenever $H$ satisfies either of the following two conditions: (1) $H$ is commutative, cancellative, and contains an invertible element of infinite order; (2) $H$ is an abelian group which is not isomorphic to the Klein four-group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongjie Peng, Guixin Deng. 2026-11-07. Automorphism of reduced finitary power monoids. https://searcharxiv.com/abs/2611.10645

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↗