Abstract
A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups and with not semiprimitive, we construct an infinite family of rank two amalgams of permutation type 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 graphs. We also consider the corresponding question for amalgams of rank . We completely resolve this by showing that the order of the Borel subgroup is bounded by the permutation type only in the trivial case where each of is regular.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.