A criteria for a finite permutation group to be transitive

2015/02/25 by Julian Brough, Brough, Julian
Computer Science · Engineering · Mathematics · #20B10 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #math.GR #msc:20B10

paper · pdf · doi:10.48550/arxiv.1502.07163

3 pages

arxiv created 2015/02/25 · openalex publication_date 2015/02/25 · arxiv updated 2015/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a finite permutation group on a finite set Ω. The notion of G being quasi-transitive on Ω was defined by Alan Camina \citeCamina; in that paper conditions were established that ensured a quasi-transitive group on a finite set Ω was transitive on Ω. The aim of this paper is to validate the conjecture made in \citeCamina: given any group G, if G is quasi-transitive on a finite set Ω then G is transitive on Ω.

Related

• The classification of (3/2)-transitive permutation groups and (1/2)-transitive linear groups
• On κ-homogeneous, but not κ-transitive permutation groups
• A new notion of transitivity for groups and sets of permutations
• Quasiprimitive groups containing a transitive alternating group
• On solvable minimally transitive permutation groups