A lower bound for the number of conjugacy classes of finite groups

Thomas Michael Keller

Home/Archive/arXiv

arXiv · 0708.2281

A lower bound for the number of conjugacy classes of finite groups

Thomas Michael Keller

View original source ↗Read source document ↗Export metadata ↓

Abstract

In 2000, L. Héthelyi and B. Külshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the result remains true for arbitrary finite groups.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Thomas Michael Keller. 2007-08-16. A lower bound for the number of conjugacy classes of finite groups. https://arxiv.org/abs/0708.2281

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

KEEP EXPLORING

Related papers

arXiv2026

Left and right zero subsemigroups and an elementary approach to the Rees-Sushkevich Theorem

In a semigroup $S$ with idempotent $e$, the set of all elements $a$ of $S$ such that $ae=a$ and $ea=e$ forms the maximum left zero subsemigroup of $S$ containing $e$, and the set of all elements $b$ of $S$ such that $be=e$ and $eb=b$ forms the maximum right zero subsemigroup of $S$ containing $e$. We use these maximal right and left zero subsemigroups along with the maximal subgroups of a semigroup in the determination of maximal right and left subgroups, rectangular band subsemigroups, completely simple subsemigroups, rectangular subgroups, and completely $0$-simple subsemigroups. An elementary approach of the Rees-Sushkevich Theorem follows. Then we define rectangular $0$-bands and rectangular $0$-groups as completely $0$-simple analogues of rectangular bands and rectangular groups.

math.GR↗

arXiv2026

On a theorem of Artin and the dimension of the space spanned by the rational valued characters of a group

In this paper, we sharpen a theorem of Artin to show that for a finite group, the dimension of the subspace of class functions spanned by the rational valued characters equals the number of conjugacy classes of cyclic subgroups.

math.GR↗

arXiv2026

Common overlattices in trees and trees with fins

Bass and Kulkarni proved that any pair of free uniform lattices in the automorphism group of a tree have conjugates that both lie inside a third uniform lattice (which is not necessarily free). We show that this does not generalise to trees with fins. The construction of our counter-example involves working with a certain generalisation of the universal groups of Burger and Mozes.

math.GR↗