Related papers: Bipartite dimer model: perfect t-embeddings and Lo…

For a given simply connected Riemannian surface Sigma, we relate the problem of finding minimal isometric immersions of Sigma into S^2 x R or H^2 x R to a system of two partial differential equations on Sigma. We prove that a constant…

For the set of graphs with a given degree sequence, consisting of any number of $2's$ and $1's$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of $m$-matchings. We find the…

We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…

We study conformal bi-slant submersions from almost Hermitian manifolds onto Riemannian manifolds as a generalized of conformal anti-invariant, conformal semi-invariant, conformal semi-slant, conformal slant and conformal hemi-slant…

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

For any compact Riemannian manifold $(M,g)$ and its heat kernel embedding map $psi_t$ from M into $l^2$ constructed in [BBG], we study the higher derivatives of $psi_t$ with respect to an orthonormal basis at $x$ on $M$. As the heat flow…

We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…

We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…

We study the isotropic six-vertex model on $\mathbb{Z}^2$ with spectral parameter $\Delta\in[-1,-1/2]$, that is, with weights $\mathbf{a}=\mathbf{b}=1$ and $\mathbf{c}\in[\sqrt{3},2]$. We show that the associated height function converges,…

This paper proves several topological results for smooth gradient Ricci shrinkers. We establish upper bounds for the Betti numbers, a vanishing theorem for cohomology, and a dichotomy for the number of ends. We also prove a full Hodge…

In this paper, we study Riemannian zeroth-order optimization in settings where the underlying Riemannian metric $g$ is geodesically incomplete, and the goal is to approximate stationary points with respect to this incomplete metric. To…

S-embeddings were introduced by Chelkak as a tool to study the conformal invariance of the thermodynamic limit of the Ising model. Moreover, Chelkak, Laslier and Russkikh introduced a lift of s-embeddings to Lorentz space, and showed that…

The 2D Discrete Gaussian model gives each height function $\eta : \mathbb{Z}^2\to\mathbb{Z}$ a probability proportional to $\exp(-\beta \mathcal{H}(\eta))$, where $\beta$ is the inverse-temperature and $\mathcal{H}(\eta) = \sum_{x\sim…

Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bipartite graphs on which the number of perfect matchings can…

Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…

For an oriented isometric immersion $f:M\to S^n$ the spherical Gauss map is the Legendrian immersion of its unit normal bundle $UM^\perp$ into the unit sphere subbundle of $TS^n$, and the geodesic Gauss map $\gamma$ projects this into the…

The perfect matching problem has a randomized NC algorithm, using the celebrated Isolation Lemma of Mulmuley, Vazirani and Vazirani. The Isolation Lemma states that giving a random weight assignment to the edges of a graph, ensures that it…

In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…