Permutation groups without exponentially many orbits on the power set
DOI10.1016/0097-3165(94)90056-6zbMath0803.20001MaRDI QIDQ1323837
Publication date: 4 January 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(94)90056-6
permutation groups; order; number of orbits; alternating sections; automorphism group of a Steiner system; set of blocks; subdirect product of transitive groups
20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
20D60: Arithmetic and combinatorial problems involving abstract finite groups
11N45: Asymptotic results on counting functions for algebraic and topological structures
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
51E10: Steiner systems in finite geometry
20B05: General theory for finite permutation groups
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular orbits of permutation groups on the power set
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- On the orders of primitive groups with restricted nonabelian composition factors
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Transitivity of permutation groups on unordered sets
- On the orders of doubly transitive permutation groups, elementary estimates
- Orbits of Infinite Permutation Groups
- Finite Groups Have Many Conjugacy Classes
- On the orders of Primitive Permutation Groups
- Set-Transitive Permutation Groups