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

Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…

In this note we give a short and elementary proof of a more general version of Whitney's theorem that 3-connected planar graphs have a unique embedding in the plane. A consequence of the theorem is that cubic plane graphs cannot be embedded…

We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and…

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases,…

A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…

A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

We consider immersions admitting uniform representations as an L-Lipschitz graph. In codimension 1, we show compactness for such immersions for arbitrary fixed finite L and uniformly bounded volume. The same result is shown in arbitrary…

Whitney's 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. We present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic…

In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

For isolated complex hypersurface singularities with real defining equation we show the existence of a monodromy vector field such that complex conjugation intertwines the local monodromy diffeomorphism with its inverse. In particular, it…

We prove that for any fixed unitary matrix $U$, any abelian self-adjoint algebra of matrices that is invariant under conjugation by $U$ can be embedded into a maximal abelian self-adjoint algebra that is still invariant under conjugation by…

Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their…