Wikipedia:Reference desk/Archives/Mathematics/2021 October 28

From Wikipedia, the free encyclopedia
Mathematics desk
< October 27 << Sep | October | Nov >> October 29 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


October 28[edit]

9-coloured genus-3 complete map[edit]

8-coloured genus-2 complete map

For the Heawood conjecture article, I had previously drawn this diagram based on "Tietze's Berühmte Mathematische Probleme, originally published in 1911. It appears in (and on the cover of) the translation, Famous Problems of Mathematics, Graylock Press, New York; 2nd edition (1965)."

I would like to draw a similar one for genus 3. http://www.ams.org/publicoutreach/feature-column/fc-2018-05 gives a hint of adjacent regions as a table: http://www.ams.org/images/fcarc-may2018-Heffter-genus-3.jpg and proposes a challenge:

We encourage the reader to try to construct a more geometrically intelligible complete map with nine regions on the genus-three surface, and perhaps to render it in crochet.

Would anyone have a method to translate that into a legible diagram?

Thanks,
cmɢʟeeτaʟκ 21:52, 28 October 2021 (UTC)[reply]

  • That looks like it's been inspired by a Mayan/Aztec headdress. -- Jack of Oz [pleasantries] 21:36, 29 October 2021 (UTC)[reply]
    • Perhaps 😅 Would you have an answer to the question, though? cmɢʟeeτaʟκ 00:20, 31 October 2021 (UTC)[reply]
      • Seems like you could layout the regions on a genus 3 surface by brute force search? 9 regions isn't all that many. Then you'd want to munge the result around til it looked nice. I don't fully understand the notation in that table: what do the little arcs connecting some of the numbers mean? 2601:648:8202:350:0:0:0:D4A (talk) 00:48, 31 October 2021 (UTC)[reply]
        It is slightly confusing that the terminology in the journal article from which the table is copied is dual to that of the web page; the web page's regions are vertices in Hefter's article, and his faces are the web page's vertices. I'll stick to the terminology of the web page; then there are 9 regions, numbered 1 through 9. Then, for example ,
        means that region borders the eight regions , , , , , , and in that order along its perimeter (presumably in the same orientation for all lines of the table), that the three regions , and border each other and so meet in a tri-valent vertex, and that borders and , but that and do not border each other; the three meet in the six-valent vertex, so around that vertex there are some more regions wedged in between and . (The last line implies that two different corners of region contribute to the six-valence.)  --Lambiam 12:10, 31 October 2021 (UTC)[reply]
@Cmglee: — Perhaps the following is somewhat helpful. I imagine the edges forming the perimeter of a region being traversed anti-clockwise, viewed from the interior of the region. Let
represent an edge of the perimeter of region , bordering , traversed anti-clockwise. If the next edge along the perimeter is
and the inbetween vertex is trivalent, let us denote it by
Putting the edges together, showing the shared vertex, we obtain the picture
(Think of a clock face on region ; then this vertex is at six o'clock.) Note that and are the same vertex viewed from different regions. To obtain a view-independent, simple notation for the 22 trivalent vertices, we'll use instead the first 22 capital Greek letters:
The notation is reserved for the vertex of valence six.
Using this notation, the edge walks along the perimeters of each of the nine octagonal regions are then given by:
This fixes the topology. Embedding it in 3D is a different matter. It may be best to start with stitching the regions and together; they all have only trivalent corner vertices. Region is an obvious candidate for being stitched on last; it meets itself, having two of its corners on . (Or perhaps it is better to go the other way and start with and the other four regions meeting in regions and )  --Lambiam 14:00, 2 November 2021 (UTC)[reply]
Note that regions and also meet in which is adjacent to  --Lambiam 19:29, 2 November 2021 (UTC)[reply]
@Lambiam: Thank you so much for your thorough analysis and beautiful presentation. I'm still unsure how to proceed after sketching layouts for regions 4, 7, 8, 9 and 2. There are many repeated regions, in particular, 3, and I've no idea how to join them together. I also can't see how there can be a vertex with more than 3 regions (trivalent): doesn't that mean regions diagonally opposite just touch at the vertex and are not considered adjacent?
Instead, I tried adapting the genus 2 diagram and am short of just one region to connect. If I add a region where red, pink and yellow regions meet (between the second and third bubbles in the top left) and another region between the dark blue and green regions (the gap between the third and fourth bubbles in the top right), and join them together with a bridge (giving genus 3), I connect all 8 regions except the orange one, the largest region covering most of the back of the object. Can this be improved or is it a dead end?
Thanks,
cmɢʟeeτaʟκ 00:15, 4 November 2021 (UTC)[reply]
Mathematicians realized early on that the four-color theorem could be expressed in the language of graph theory, avoiding all kinds of potential ambiguity or weirdness surrounding the notions of "region" and "adjacency of regions". The concept of chromatic number is defined in purely graph-theoretical terms. To apply this to the four-color theorem, you need the notion of a planar graph. It has an obvious generalization to arbitrary two-dimensional manifolds, such as the torus, the Klein bottle, and surfaces of any genus, whether orientable or non-orientable. When a graph is embedded in a surface such that edges intersect only at their endpoints, it divides the surface into regions, usually (the interiors of topological) polygons. There is no ambiguity if some of these polygons have more than three edges; adjacency of vertices is explicitly defined in the original graph. It is only when switching back to the dual viewpoint, in which vertices become regions and regions become vertices, that a potential ambiguity appears. The original formulations of the four-colour conjecture defined adjacency as having a common boundary line, so an -point with does not introduce additional adjacencies. For crocheting, the graph view is not very interesting, but for construction on a surface of genus 3, it may be the simpler approach – I just don't know. Perhaps another reader here can help you with your last question.  --Lambiam 09:22, 4 November 2021 (UTC)[reply]
Thanks again, Lambiam. I'm aware of the region-vertex equivalence. Just wondering that more than 3 edges from a vertex means that some regions are adjacent only at a point. Anyway, I appreciate your effort. Cheers, cmɢʟeeτaʟκ 19:35, 4 November 2021 (UTC)[reply]
P.S. Not exactly what i wanted, but close: