SearcharxivSearch

arXiv · 1107.5058

A characterization of normal subgroups via n-closed sets

Abstract

Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets arise in so many natural examples. For example, let D be the set of all odd integers, then (D, +) is a 3-closed subset of (Z, +) that is not a 2-closed subset of (Z, +). If K = {1, 4, 7, 10, ...}, then (K, +) is a 4-closed subset of (Z, +) that is not an n-closed subset of (Z, +) for n = 2, 3. In this paper, we show that if (H, *) is a subgroup of a group (G, *) such that [H: G] = n < infty, then H is a normal subgroup of G if and only if every left coset of $H$ is an (n+1)-closed subset of G.

Explore related subjects

Keep this discovery

BibTeXRIS

Ayman Badawi. 2011-07-25. A characterization of normal subgroups via n-closed sets. https://arxiv.org/abs/1107.5058

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