Asymptotic behavior of finite permutation groups acting on subsets.
Let a finite permutation group \(G\) act transitively on a set \(\Omega\) of finite size \(n\). Then \(G\) acts naturally on \(P(\Omega)\), the set of all subsets of \(\Omega\). For \(X\in P(\Omega)\) let \(G(X)\) denote the orbit of \(G\) containing \(X\). The main result of the paper is the following Theorem: Let \(n>276\). Suppose \(G\leq S_n\) is primitive and satisfies \(|G(X)|\geq 2n^2\) for all subsets \(X\) of \(\Omega=\{1,\dots,n\}\) such that \(\sqrt n\leq|X|\leq n-\sqrt n\). Then \(G=A_n\) or \(S_n\). The proof makes use of the classification of finite simple groups, the condition \(n>276\) being used to avoid the discussion of doubly-transitive groups having a sporadic socle. There are applications of the Theorem to the study of threshold behavior of monotone Boolean functions which are discussed in the introduction.
- Primitive permutation groups satisfying the small orbit property and a problem of Bourgain and Kalai
- Asymptotically free action of permutation groups on subsets and multisets.
- On groups with no regular orbits on the set of subsets
- scientific article; zbMATH DE number 1047717
- Permutation groups on unordered sets. I
- Every monotone graph property has a sharp threshold
- Finite Permutation Groups and Finite Simple Groups
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Influences of variables and threshold intervals under group symmetries
- The 2-Transitive Permutation Representations of the Finite Chevalley Groups
This page was built for publication: Asymptotic behavior of finite permutation groups acting on subsets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556965)