𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular Maps Constructed from Linear Groups

✍ Scribed by Peter McMullen; Barry Monson; Asia Ivić Weiss


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
380 KB
Volume
14
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


For an integer (m>2), let (L_{2}^{\langle-1\rangle}\left(\mathbb{Z}{m}\right)) be the group of (2 \times 2) matrices over (\mathbb{Z}{m}) with determinants (\pm 1). Then for each subgroup (H) with ({ \pm 1} \leqslant H \leqslant \operatorname{centre}\left(L_{2}^{(-1)}\left(\mathbb{Z}{m}\right)\right)) there exists a regular map of type ({3, m}) whose group is (L{2}^{(-1)}\left(\mathbb{Z}{m}\right) / H). Ways are determined in which one such map can cover another, and in which a map decomposes as a blend of simpler maps. In all this, the prime factorization of (m) plays the key role. In some cases the structural results enable a simple description of the corresponding automorphism groups. Also described are realizations for the maps based on the 'plane' (\mathbb{Z}{m}^{2}).


📜 SIMILAR VOLUMES


Regular Maps from Voltage Assignments an
✍ Roman Nedela; Martin Škoviera 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 268 KB

In the paper is developed a common generalization of two methods of construction of regular maps on surfaces. The first one produces graph covering projections that extend to coverings of regular embeddings of the graphs involved. The second method employs a double covering projection of graphs whic

Graphs obtained from Moufang loops and r
✍ T.S. Griggs; J. Širáň; R.B. Richter 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

## Abstract Using ideas from regular maps, we prove the existence of infinitely many non‐vertex‐transitive Cayley graphs obtained from Moufang loops. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory

Cohomological Constructions of Regular C
✍ David B. Surowski; Gareth A. Jones 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 169 KB

In [5] we described the regular maps and hypermaps which are cyclic coverings of the Platonic maps, branched over the face centers, vertices or midpoints of edges. Here we determine cochains by which these coverings can be explicitly constructed.

Regular graphs constructed from the clas
✍ L. Beukemann; K. Metsch 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Let c k be the smallest number of vertices in a regular graph with valency k and girth 8. It is known that c k+1 ≥ 2(1+k+k 2 +k 3 ) with equality if and only if there exists a finite generalized quadrangle of order k. No such quadrangle is known when k is not a prime power. In this case, small regul