On the order of Borel subgroups of group amalgams and an application to locally-transitive graphs

2014/06/05 by Morgan, Luke, Spiga, Pablo, Verret, Gabriel · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1406.1370

Abstract

A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups L₁ and L₂ with L₁ not semiprimitive, we construct an infinite family of rank two amalgams of permutation type [L₁,L₂] and Borel subgroups of strictly increasing order. As an application, we show that there is no bound on the order of edge-stabilisers in locally [L₁,L₂] graphs. We also consider the corresponding question for amalgams of rank k≥ 3. We completely resolve this by showing that the order of the Borel subgroup is bounded by the permutation type [L₁,...,L_k] only in the trivial case where each of L₁,...,L_k is regular.

Cited by

• Separating subsets from their images

Related

• A theory of semiprimitive groups
• On graph-restrictive permutation groups
• On the order of vertex-stabilisers in vertex-transitive graphs with\n local group C_p\× C_p or C_p wr C₂
• Finite semiprimitive permutation groups of rank 3
• Bounds for Finite Semiprimitive Permutation Groups: Order, Base Size,\n and Minimal Degree