SearcharxivSearch

arXiv · 1512.05117

A note on filled groups

Abstract

Let $G$ be a finite group and $S$ a subset of $G$. Then $S$ is {\em product-free} if $S \cap SS = \emptyset$, and $S$ {\em fills} $G$ if $G^{\ast} \subseteq S \cup SS$. A product-free set is locally maximal if it is not contained in a strictly larger product-free set. Street and Whitehead [J. Combin. Theory Ser. A \textbf{17} (1974), 219--226] defined a group $G$ as {\em filled} if every locally maximal product-free set in $G$ fills $G$. Street and Whitehead classified all abelian filled groups, and conjectured that the finite dihedral group of order $2n$ is not filled when $n=6k+1$ ($k\geq 1$). The conjecture was disproved by the current authors in [Austral. Journal of Combinatorics \textbf{63 (3)} (2015), 385--398], where we also classified the filled groups of odd order. This brief note completes the classification of filled dihedral groups and discusses filled groups of order up to 100.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarah Hart, Chimere Anabanti. 2015-12-17. A note on filled groups. https://arxiv.org/abs/1512.05117

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