SearcharxivSearch

arXiv · 1312.6886

On asymptotically free action of permutation groups on subsets and multisets

Abstract

Let $G$ be a permutation group acting on a finite set $Ω$ of cardinality $n$. The number of orbits of the induced action of $G$ on the set $Ω_m$ of all size $m$ subsets of $Ω$ satisfies the trivial inequalities $|Ω_m|/|G|\leq |Ω_m/G|\leq |Ω_m|$. The paper offers improvements of the upper bound in terms of the minimal degree of $G$ or the minimal degree of some its subset with a small complement. Applications include asymptotic enumeration of point configurations in an affine space over a finite field, unlabeled graphs and hypergraphs. Finally, with references to known results of permutation groups theory it is shown that if $G$ is an arbitrary 2-transitive group except for $S_n$ and $A_n$, then $|Ω_m/G|\approx |Ω_m|/|G|$ for $m$ and $n$ large provided the ratio $m/n$ is bounded away from 0 and 1. Similar results hold for the induced action of $G$ on the set $Ω_{(m)}$ of all weight $m$ multisets on $Ω$ provided the ratio $m/n$ is not too small.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Sadov. 2014-12-02. On asymptotically free action of permutation groups on subsets and multisets. https://doi.org/10.1515/dma-2015-0004%2C%2010.4213%2Fdm1294

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