Related papers: On $Z$-monodromies in embedded graphs

In this paper, we introduce two new classes of representations of the framed braid groups. One is the homological representation constructed as the action of a mapping class group on a certain homology group. The other is the monodromy…

The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

We show that for most pairs of surfaces, there exists a finite subgraph of the flip graph of the first surface so that any injective homomorphism of this finite subgraph into the flip graph of the second surface can be extended uniquely to…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Let $G$ be a connected reductive affine algebraic group defined over $\mathbb C$ and $\mathfrak g$ its Lie algebra. We study the monodromy map from the space of $\mathfrak g$-differential systems on a compact connected Riemann surface…

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

In this paper, we consider the monoids of all endomorphisms, of all weak endomorphisms, of all strong endomorphisms and of all strong weak endomorphisms of a star graph with a finite number of vertices. Our main objective is to exhibit a…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

For a punctured surface $S$, we characterize the representations of its fundamental group into $\mathrm{PSL}_2 (\mathbb{C})$ that arise as the monodromy of a meromorphic projective structure on $S$ with poles of order at most two and no…

We study deformations of graphical zonotopes. Deformations of the classical permutahedron (which is the graphical zonotope of the complete graph) have been intensively studied in recent years under the name of generalized permutahedra. We…

We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…

We consider simply connected log-Riemann surfaces with a finite number of ramification points. We prove that these surfaces are biholomorphic to C with uniformizations given by entire functions of the form F (z) = \int Q(z) e^{P(z)} dz…

We show that given a dominant morphism between two smooth varieties of the same dimension, the induced morphism between the formal neighborhoods of two arcs on these varieties is a closed embedding, of codimension given by the order of…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…