A characterisation of weakly locally projective amalgams related to $A_{16}$ and the sporadic simple groups $M_{24}$ and $He$
Michael Giudici, A. A. Ivanov, Luke Morgan, Cheryl E. Praeger

TL;DR
This paper characterizes certain weakly locally projective graphs related to sporadic simple groups, identifying unique and multiple amalgams and their properties, especially focusing on cases connected to $M_{24}$, $He$, and $A_{16}$.
Contribution
It classifies specific weakly locally projective amalgams associated with $M_{24}$, $He$, and $A_{16}$, expanding understanding of their structural properties.
Findings
Exactly two amalgams correspond to the examples from $M_{24}$ and $He$.
For the family $$, if $n extgreater= 5$, there is a unique unfaithful amalgam.
When $n=4$, there are four amalgams, including two faithful ones related to $M_{24}$ and $He$, and one related to $A_{16}$.
Abstract
A simple undirected graph is weakly -locally projective, for a group of automorphisms , if for each vertex , the stabiliser induces on the set of vertices adjacent to a doubly transitive action with socle the projective group for an integer and a prime power . It is -locally projective if in addition is vertex transitive. A theorem of Trofimov reduces the classification of the -locally projective graphs to the case where the distance factors are as in one of the known examples. Although an analogue of Trofimov's result is not yet available for weakly locally projective graphs, we would like to begin a program of characterising some of the remarkable examples. We show that if a graph is weakly locally projective with each and or , and if the distance factors are as in the examples arising from the rank 3 tilde…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
