The number of set-orbits of a solvable permutation group
From MaRDI portal
Publication:2111340
DOI10.1515/jgth-2021-0066OpenAlexW4200326693MaRDI QIDQ2111340
Publication date: 13 January 2023
Published in: Journal of Group Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jgth-2021-0066
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Finite groups have even more conjugacy classes.
- Multiplicities of conjugacy class sizes of finite groups.
- A polynomial bound for the orders of primitive solvable groups
- Permutation groups without exponentially many orbits on the power set
- A lower bound for the number of odd-degree representations of a finite group
- Solvable and Nilpotent Subgroups of GL(n,qm)
- Primitive Groups with no Regular Orbits on the Set of Subsets
- On the Number ofp'-Degree Characters in a Finite Group
- Trivial Set-Stabilizers in Finite Permutation Groups
- Permutation groups and orbits on the power set
- Solvable Permutation Groups and Orbits on Power Sets
- Set-Transitive Permutation Groups
- Irreducible representations of odd degree
This page was built for publication: The number of set-orbits of a solvable permutation group