Permutation groups without exponentially many orbits on the power set
alternating sectionsautomorphism group of a Steiner systemnumber of orbitsorderpermutation groupsset of blockssubdirect product of transitive groups
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Asymptotic results on counting functions for algebraic and topological structures (11N45) General theory for finite permutation groups (20B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Steiner systems in finite geometry (51E10)
The main result of the paper gives the existence of an (explicitly not calculated) constant \(c_ 1\) such that if \(G\) is a permutation group of degree \(n\) without any composition factors isomorphic to an alternating group of degree \(> t \geq 4\), then the number of orbits of \(G\) on the power set is at least \(\text{exp}(c_ 1 n/t)\). \{The proof -- as given -- works only if large alternating sections are excluded, but it can be modified to yield the stated form of the result. Namely, in the imprimitive case one should use the fact that the kernel of the action on the set of blocks is a subdirect product of transitive groups of smaller degree. The same inaccuracy has already occured in the paper of \textit{L. Babai, P. J. Cameron} and the reviewer [J. Algebra 79, 161-168 (1982; Zbl 0493.20001)].\} The result is then applied to the case when \(G\) is the automorphism group of a Steiner system. In that case the order of \(G\) is also estimated. \{The last displayed inequality in the proof of Lemma A3 is in error, but it can be corrected at the cost of increasing the constant to \(c=4+o(1)\).\} The proofs are elementary.
- Permutation groups and orbits on the power set
- Permutation groups and set-orbits on the power set
- The number of set orbits of permutation groups and the group order
- Orbits on n-tuples for infinite permutation groups
- The case of equality in the Livingstone-Wagner theorem.
- Régularisation numérique d'orbites
- Solvable Permutation Groups and Orbits on Power Sets
- Orbits of Infinite Permutation Groups
- On the Livingstone-Wagner theorem.
- On the Orbit Sizes of Permutation Groups on the Power Set
- Finite Groups Have Many Conjugacy Classes
- scientific article; zbMATH DE number 5657589 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- On the orders of doubly transitive permutation groups, elementary estimates
- On the orders of primitive groups with restricted nonabelian composition factors
- On the orders of Primitive Permutation Groups
- Orbits of Infinite Permutation Groups
- Regular orbits of permutation groups on the power set
- Set-Transitive Permutation Groups
- Theory of games and economic behavior.
- Transitivity of permutation groups on unordered sets
- On groups with no regular orbits on the set of subsets
- Regular orbits of permutation groups on the power set
- Orbits of permutation groups on the power set
- On the orders of doubly transitive permutation groups, elementary estimates
- Permutation groups and set-orbits on the power set
- The number of set-orbits of a solvable permutation group
- Finite permutation groups with few orbits under the action on the power set
- scientific article; zbMATH DE number 4152666 (Why is no real title available?)
- Lower bounds for the number of conjugacy classes of finite groups
- scientific article; zbMATH DE number 4073255 (Why is no real title available?)
- A family of permutation groups with exponentially many nonconjugated regular elementary abelian subgroups
- Complex group algebras of finite groups: Brauer’s Problem 1
- The number of set orbits of permutation groups and the group order
- Permutation groups and orbits on the power set
- Finite groups have more conjugacy classes
- Finite groups have even more conjugacy classes.
- Solvable Permutation Groups and Orbits on Power Sets
- Groups acting on a set whose orbits are all singleton
- Methods and questions in character degrees of finite groups
- Multiplicities of conjugacy class sizes of finite groups.
- Solvable permutation group of odd order and orbits on the power set
- Permutation groups on unordered sets. I
- Complex group algebras of finite groups: Brauer's problem 1.
This page was built for publication: Permutation groups without exponentially many orbits on the power set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323837)
