Related papers: Partial duality and closed 2-cell embeddings

The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…

Given an $r$-edge-colouring of the edges of a graph $G$, we say that it can be partitioned into $p$ monochromatic cycles when there exists a set of $p$ vertex-disjoint monochromatic cycles covering all the vertices of $G$. In the literature…

Bipartite graph tiling was studied by Zhao who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K_{s,s}. Let s<t be fixed positive integers. Hladk\'y and…

We describe the duality between different geometries which arises by considering the classical and quantum harmonic map problem. To appear in ``Essays on Mirror Manifolds II''.

The domatic number of a graph is the maximum number of vertex disjoint dominating sets that partition the vertex set of the graph. In this paper we consider the fractional variant of this notion. Graphs with fractional domatic number 1 are…

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…

A \emph{proportionally dense subgraph} (PDS) is an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the rest of the graph. In this paper, we study…

In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture purports that if a graph is bridgeless, then there exists a list of cycles in the graph such that every edge in the graph appears in…

A finite subset S of a closed hyperbolic surface F canonically determines a "centered dual decomposition" of F: a cell structure with vertex set S, geodesic edges, and 2-cells that are unions of the corresponding Delaunay polygons. Unlike a…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

In this paper, we establish the partial correlation graph for multivariate continuous-time stochastic processes, assuming only that the underlying process is stationary and mean-square continuous with expectation zero and spectral density…

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

We study homological properties of a locally complete intersection ring by importing facts from homological algebra over exterior algebras. One application is showing that the thick subcategories of the bounded derived category of a locally…

The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

In Part I, we extend our analysis in [arXiv:0807.1107], and show that a mathematically conjectured geometric Langlands duality for complex surfaces in [1], and its generalizations -- which relate some cohomology of the moduli space of…

This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…

Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…

We consider a bipartite version of the color degree matrix problem. A bipartite graph $G(U,V,E)$ is half-regular if all vertices in $U$ have the same degree. We give necessary and sufficient conditions for a bipartite degree matrix (also…