Coverings of Graphoids: Existence Theorem and Decomposition Theorems

Autor: Aleksander Malnič, Boris Zgrablić
Jazyk: angličtina
Rok vydání: 2024
Předmět:
Zdroj: Symmetry, Vol 16, Iss 3, p 375 (2024)
Druh dokumentu: article
ISSN: 2073-8994
DOI: 10.3390/sym16030375
Popis: A graphoid is a mixed multigraph with multiple directed and/or undirected edges, loops, and semiedges. A covering projection of graphoids is an onto mapping between two graphoids such that at each vertex, the mapping restricts to a local bijection on incoming edges and outgoing edges. Naturally, as it appears, this definition displays unusual behaviour since the projection of the corresponding underlying graphs is not necessarily a graph covering. Yet, it is still possible to grasp such coverings algebraically in terms of the action of the fundamental monoid and combinatorially in terms of voltage assignments on arcs. In the present paper, the existence theorem is formulated and proved in terms of the action of the fundamental monoid. A more conventional formulation in terms of the weak fundamental group is possible because the action of the fundamental monoid is permutational. The standard formulation in terms of the fundamental group holds for a restricted class of coverings, called homogeneous. Further, the existence of the universal covering and the problems related to decomposing regular coverings via regular coverings are studied in detail. It is shown that with mild adjustments in the formulation, all the analogous theorems that hold in the context of graphs are still valid in this wider setting.
Databáze: Directory of Open Access Journals
Nepřihlášeným uživatelům se plný text nezobrazuje