2022/08/22 by Dimitri Leemans, Leemans, Dimitri, Micael Toledo +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2208.10195
openalex publication_date 2022/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A maniplex of rank n is a combinatorial object that generalises the notion of a rank n abstract polytope. A maniplex with the highest possible degree of symmetry is called reflexible. In this paper we prove that there is a rank 4 reflexible maniplex with automorphism group \textrmPSL2(q) for infinitely many prime powers q, and that no reflexible maniplex of rank n > 4 exists that has \textrmPSL2(q) as its full automorphism group.