SearcharxivSearch

arXiv · 1604.01119

Group Structures on Families of Subsets of a Group

Abstract

A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results serve to characterize some types of groups in terms of their power groups. In particular, we consider when the only power groups of a group are the factor groups of its subgroups and when that is the case up to isomorphism. We prove that the former are precisely those groups for which every element has finite order and provide examples to illustrate that the latter is not always the case. In the process we consider several natural questions such as whether the identity element of the group must belong to the identity element of a power group or the inverse of an element in a power group must consist of the inverses of its elements.

Explore related subjects

Keep this discovery

BibTeXRIS

Mario Gómez, Sergio R. López-Permouth, Fernando Mazariegos, Alejandro José Vargas De León, Rigoberto Zelada Cifuentes. 2016-08-26. Group Structures on Families of Subsets of a Group. https://arxiv.org/abs/1604.01119

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR