SearcharxivSearch

arXiv · math/0303295

C-Groups

Abstract

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program) and traditional methods, we identified an interesting infinite class of C-groups. In particular, we have proved that there is always a C-group of order an integer multiple of a fifth power of a prime. One way to obtain C-groups is take the direct product of certain C-groups, mentioned in this paper, with other appropriate groups. We, at this time, do not know whether the C-groups discussed in this paper are the building block of all finite C-groups. But a complete classification of finite or infinite C-groups is an interesting problem. We have also formulated a number of open questions relating to C-groups: Are they all solvable? What is the structure of the C-groups that are not in our class? Is the minimal number of generators of the center always polynomially bounded by the minimal number of generators of the group? What are the isoperimetric inequalities of infinite C-groups?

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mihai Tohaneanu, Margarethe Flanders, Avi Silterra. 2003-03-24. C-Groups. https://arxiv.org/abs/math/0303295

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