Related papers: Identities between dimer partition functions on di…
For essentially bounded functions on a (closed) compact Riemannian manifold, the noncommutative residue and the Dixmier trace formulation of the noncommutative integral are shown to equate to a multiple of the Lebesgue integral. The…
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
Indyk and Sidiropoulos (2007) proved that any orientable graph of genus $g$ can be probabilistically embedded into a graph of genus $g-1$ with constant distortion. Viewing a graph of genus $g$ as embedded on the surface of a sphere with $g$…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
Let $(\Sigma,g)$ be a closed Riemannian surface, $W^{1,2}(\Sigma,g)$ be the usual Sobolev space, $\textbf{G}$ be a finite isometric group acting on $(\Sigma,g)$, and $\mathscr{H}_\textbf{G}$ be a function space including all functions $u\in…
In this paper we consider determining a minimal surface embedded in a Riemannian manifold $\Sigma\times \mathbb{R}$. We show that if $\Sigma$ is a two dimensional Riemannian manifold with boundary, then the knowledge of the associated…
We give sufficient and necessary geometric conditions, guaranteeing that an immersed compact closed manifold $\Sigma^m\subset \R^n$ of class $C^1$ and of arbitrary dimension and codimension (or, more generally, an Ahlfors-regular compact…
We prove an index formula for the Dirac operator acting on two-valued spinors on a $3$-manifold $M$ which branch along a smoothly embedded graph $\Sigma \subset M$, and with respect to a boundary condition along $\Sigma$ inspired by an…
For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…
Let $G$ be a graph embedded in a surface and let $\mathcal F$ be a set of even faces of $G$ (faces bounded by a cycle of even length). The resonance graph of $G$ with respect to $\mathcal F$, denoted by $R(G;\mathcal F)$, is a graph such…
We explore the geometric interpretation of the twisted index of 3d ${\mathcal N} =4$ gauge theories on $S^1\times \Sigma$ where $\Sigma$ is a closed Riemann surface. We focus on a rich class of supersymmetric quiver gauge theories that have…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $L(G)$ be the line graph of $G$, which has vertex set $E(G)$ and two vertices $e$ and $f$ of $L(G)$ is adjacent if $e$ and $f$ is incident in $G$. The vertex-edge graph…
Let $(G,G_1)=(G,(G^\sigma)_0)$ be a symmetric pair of holomorphic type, and we consider a pair of Hermitian symmetric spaces $D_1=G_1/K_1\subset D=G/K$, realized as bounded symmetric domains in complex vector spaces ${\mathfrak…
Spectral characterizations of graphs is an important topic in spectral graph theory which has been studied extensively by researchers in recent years. The study of oriented graphs, however, has received less attention so far. In Qiu et…
We give a Riemannian structure to the set $\Sigma$ of positive invertible unitized Hilbert-Schmidt operators, by means of the trace inner product. This metric makes of $\Sigma$ a nonpositively curved, simply connected and metrically…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
An oriented graph $G^\sigma$ is a digraph without loops or multiple arcs whose underlying graph is $G$. Let $S\left(G^\sigma\right)$ be the skew-adjacency matrix of $G^\sigma$ and $\alpha(G)$ be the independence number of $G$. The rank of…
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…
The study of graph discrepancy problems, initiated by Erd\H{o}s in the 1960s, has received renewed attention in recent years. In general, given a $2$-edge-coloured graph $G$, one is interested in embedding a copy of a graph $H$ in $G$ with…
An invertible polynomial in $n$ variables is a quasihomogeneous polynomial consisting of $n$ monomials so that the weights of the variables and the quasi-degree are well defined. In the framework of the construction of mirror symmetric…