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

We characterize the monodromies of projective structures with fuchsian-type singularities. Namely, any representation from the fundamental group of a Riemann surface of finite-type in $PSL_2(\mathbb{C})$ can be represented as the holonomy…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

We define the monomial invariants of a projective variety $Z$; they are invariants coming from the generic initial ideal of $Z$. Using this notion, we generalize a result of Cook: If $Z$ is an integral variety of codimension two, satisfying…

A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…

A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing…

We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.

This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

We study topological zeta functions of complex plane curve singularities using toric modifications and further developments. As applications of the research method, we prove that the topological zeta function is a topological invariant for…

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

For any unbranched double covering of compact Riemann surfaces, we study the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We introduce $k>0$…

We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number. The semiring of all such endomorphisms can be seen as a simplex whose vertices are…

We characterise quasidiagonality of the $C^*$-algebra of a cofinal $k$-graph in terms of an algebraic condition involving the coordinate matrices of the graph. This result covers all simple $k$-graph $C^*$-algebras. In the special case of…

A meromorphic quadratic differential on a compact Riemann surface defines a complex projective structure away from the poles via the Schwarzian equation. In this article we first prove the analogue of Thurston's Grafting Theorem for the…

We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian…

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

A restricted permutation of a locally finite directed graph $G=(V,E)$ is a vertex permutation $\pi: V\to V$ for which $(v,\pi(v))\in E$, for any vertex $v\in V$. The set of such permutations, denoted by $\Omega(G)$, with a group action…

A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their…

A sequence of monoidal transformations is defined, in terms of invariants, for a singular hypersurface embedded in a smooth scheme of positive characteristic. Some examples are added to illustrate the improvement of singularities by this…