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

preprint2015arXivOpen access

Abstract

A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups L1L_1 and L2L_2 with L1L_1 not semiprimitive, we construct an infinite family of rank two amalgams of permutation type [L1,L2][L_1,L_2] 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 [L1,L2][L_1,L_2] graphs. We also consider the corresponding question for amalgams of rank k≥3k\geq 3. We completely resolve this by showing that the order of the Borel subgroup is bounded by the permutation type [L1,...,Lk][L_1,...,L_k] only in the trivial case where each of L1,...,LkL_1,...,L_k is regular.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.