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 Cyclic Coverings of the Platonic Maps
β Scribed by Gareth A. Jones; David B. Surowski
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 142 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
We use homological methods to describe the regular maps and hypermaps which are cyclic coverings of the Platonic maps, branched over the face centers, vertices or midpoints of edges.
π SIMILAR VOLUMES
## Abstract A graph is __sβregular__ if its automorphism group acts freely and transitively on the set of __s__βarcs. An infinite family of cubic 1βregular graphs was constructed in [10], as cyclic coverings of the threeβdimensional Hypercube. In this paper, we classify the __s__βregular cyclic cov
+ 1 scalars control the (n Γ n)-dimensional matrix Dv). For instance, typical theorems are: THEOREM 0.1 If v is bounded and div v and curl v belong to C k, Ξ± (or W k, p ), so does all of Dv, and its C k, Ξ± (or W k, p ) norm is controlled by that of div and curl. Another form of the same theorem is
First, we give an explicit description of all the mappings from the phase space of the Kepler problem to the phase space of the geodesics on the sphere, which transform the constants of motion of the Kepler problem to the angular momentum. Second, among these we describe those mappings that in addit
In this paper rooted loopless (near) 4-regular maps on surfaces such as the sphere and the projective plane are counted and exact formulae with up to three or four parameters for such maps are given. Several classical results on regular maps and one-faced maps are deduced.
In this paper rooted (near-) 4-regular maps on the plane are counted with respect to the root-valency, the number of edges, the number of inner faces, the number of non-root vertex loops, the number of non-root vertex blocks, and the number of multi-edges. As special cases, formulae of several types