[Paper Review] Truncation symmetry type graphs

María del Río Francos|arXiv (Cornell University)|Jun 11, 2013

Graph theory and applications5 references3 citations

TL;DR

This paper extends the classification of symmetry type graphs for truncation and leapfrog operations on k-orbit maps, generalizing prior results for k ≤ 3 to k ≤ 7 and k = 9. Using flag graphs and symmetry type graphs as tools, it establishes necessary conditions for truncation to preserve or transform orbit counts, yielding complete classifications of possible symmetry types under these operations.

ABSTRACT

There are operations that transform a map M (an embedding of a graph on a surface) into another map in the same surface, modifying its structure and consequently its set of flags F(M). For instance, by truncating all the vertices of a map M, each flag in F(M) is divided into three flags of the truncated map. Orbanic, Pellicer and Weiss studied the truncation of k-orbit maps for k < 4. They introduced the notion of T-compatible maps in order to give a necessary condition for a truncation of a k-orbit map to be either k-, 3k/2- or 3k-orbit map. Using a similar notion, by introducing an appropriate partition on the set of flags of the maps, we extend the results on truncation of k-orbit maps for k < 8 and k=9.

Motivation & Objective

• To extend the classification of symmetry type graphs for truncation and leapfrog operations on k-orbit maps beyond the previously studied cases (k ≤ 3) to k ≤ 7 and k = 9.
• To generalize the notion of T-compatibility from Orbanić, Pellicer, and Weiss to enable analysis of higher-orbit maps under truncation.
• To provide a systematic classification of possible symmetry types of truncated and leapfrog maps based on the original map’s orbit structure.
• To use symmetry type graphs as a tool to analyze how map operations affect automorphism orbit counts, particularly for non-regular maps.
• To complete a comprehensive classification of symmetry types for truncation and leapfrog operations, filling a gap left by prior work on 8-orbit maps.

Proposed method

• Utilizes flag graphs as cubic, edge-colored graphs representing the incidence structure of maps, with colors corresponding to flag operations (i = 0,1,2).
• Applies the quotient of the flag graph under the automorphism group action to construct the symmetry type graph, which encodes orbit information.
• Introduces a refined partitioning of the flag set to generalize T-compatibility, enabling analysis of k-orbit maps for k > 3.
• Employs local flag arrangements and transformation rules to model how truncation and leapfrog operations affect flag incidence and orbit structure.
• Uses the duality between truncation and leapfrog operations (via dual maps) to derive symmetry type classifications for leapfrog maps from truncation results.
• Constructs symmetry type graphs for truncated and leapfrog maps by analyzing the action of automorphism groups on the transformed flag sets, leading to tabulated classifications.

Experimental results

Research questions

• RQ1 What are the possible symmetry type graphs of the truncation of a k-orbit map for k ≤ 7 and k = 9?
• RQ2 Under what conditions does the truncation of a k-orbit map result in a k-, 3k/2-, or 3k-orbit map?
• RQ3 How does the leapfrog operation transform the symmetry type of a k-orbit map, and what are the possible resulting orbit counts?
• RQ4 Can the symmetry type graph framework be extended to classify truncation and leapfrog operations beyond k ≤ 3?
• RQ5 What is the relationship between the symmetry type graph of a map and that of its leapfrog or truncated variant?

Key findings

• The paper provides a complete classification of symmetry type graphs for the truncation of k-orbit maps for all k ≤ 7 and k = 9, extending results from Orbanić, Pellicer, and Weiss.
• For truncation, the possible orbit counts of the resulting map are shown to be k, 3k/2, or 3k, depending on the original map’s symmetry type and the T-compatibility condition.
• The leapfrog operation on a k-orbit map results in a map with symmetry type corresponding to k, 3k/2, or 3k orbits, with specific classifications provided in Table 4 for k = 6,7,9.
• The symmetry type graph of the leapfrog map is shown to be isomorphic to 3^0 when the original map has a suitable flag partition, enabling classification via quotient structures.
• The classification reveals that the leapfrog of a 2-orbit map can yield a 6-orbit map, and the leapfrog of a 3-orbit map can yield a 9-orbit map, with specific symmetry types like 6_B, 6_H, 9_C_d, etc.
• The results demonstrate that the symmetry type graph is a powerful tool for predicting the orbit structure of derived maps under truncation and leapfrog operations, even for non-regular maps.