An upper bound for the order of primitive permutation groups
From MaRDI portal
Publication:677226
DOI10.1007/BF02355333zbMath0907.20003OpenAlexW1982134021MaRDI QIDQ677226
Publication date: 4 June 1997
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/68472
primitive permutation groupsirreducible representationspermutation representationsminimal degreeminimal order
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Primitive groups (20B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coherent algebras
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- Graphs and finite permutation groups
- On the Sims Conjecture and Distance Transitive Graphs
- Finite simple groups and finite primitive permutation groups
This page was built for publication: An upper bound for the order of primitive permutation groups
