SearcharxivSearch

arXiv · 1310.1643

On the Erdos-Ko-Rado property for finite Groups

Abstract

Let a finite group $G$ act transitively on a finite set $X$. A subset $S\subseteq G$ is said to be {\it intersecting} if for any $s_1,s_2\in S$, the element $s_1^{-1}s_2$ has a fixed point. The action is said to have the {\it weak Erd\H{o}s-Ko-Rado} property, if the cardinality of any intersecting set is at most $|G|/|X|$. If, moreover, any maximal intersecting set is a coset of a point stabilizer, the action is said to have the {\it strong Erd\H{o}s-Ko-Rado} property. In this paper we will investigate the weak and strong Erd\H{o}s-Ko-Rado property and attempt to classify the groups whose all transitive actions have these properties. In particular, we show that a group with the weak Erd\H{o}s-Ko-Rado property is solvable and that a nilpotent group with the strong Erd\H{o}s-Ko-Rado property is product of a $2$-group and an abelian group of odd order.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohammad Bardestani, Keivan Mallahi-Karai. 2013-10-06. On the Erdos-Ko-Rado property for finite Groups. https://arxiv.org/abs/1310.1643

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