An upper bound for the order of primitive permutation groups

DOI10.1007/BF02355333MaRDI QIDQ677226zbMATH OpenOpenAlexFDO

Authors Ilya Ponomarenko

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

zbMATH Keywords

irreducible representationsminimal degreeminimal orderpermutation representationsprimitive permutation groups

Mathematics Subject Classification ID

Primitive groups (20B15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Review text

See the review in Zbl 0870.20004.

Cites work

• Coherent algebras
• Finite simple groups and finite primitive permutation groups
• Graphs and finite permutation groups
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• scientific article; zbMATH DE number 3032538 (Why is no real title available?)
• 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
• On the Sims Conjecture and Distance Transitive Graphs

Cited in

(1)

• A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group

This page was built for publication: An upper bound for the order of primitive permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677226)