Related papers: Calibrating Forms for Minimal Graphs in Arbitrary …
It is shown that a superconformal surface with arbitrary codimension in flat Euclidean space has a (necessarily unique) dual superconformal surface if and only if the surface is S-Willmore, the latter a well-known necessary condition to…
The boxicity of a graph $G$ is the minimum non-negative integer $k$ such that $G$ can be isomorphic to the intersection graph of a family of boxes in Euclidean $k$-space, where a box in Euclidean $k$-space is the Cartesian product of $k$…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
We study Euclidean Wilson loops at strong coupling using the AdS/CFT correspondence, where the problem is mapped to finding the area of minimal surfaces in Hyperbolic space. We use a formalism introduced recently by Kruczenski to…
We investigate the minimal and isoperimetric surface problems in a large class of sub-Riemannian manifolds, the so-called Vertically Rigid spaces. We construct an adapted connection for such spaces and, using the variational tools of…
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…
Given a finite simple connected graph $\Gamma$, the graphical configuration space $\mathrm{Conf}_{\Gamma}(X)$ is the space of collections of points in $X$ indexed by the vertices of $\Gamma$, where points corresponding to adjacent vertices…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
How to obtain a graph from data samples is an important problem in graph signal processing. One way to formulate this graph learning problem is based on Gaussian maximum likelihood estimation, possibly under particular topology constraints.…
Constrained Hamiltonian systems fall into the realm of presymplectic geometry. We show, however, that also Poisson geometry is of use in this context. For the case that the constraints form a closed algebra, there are two natural Poisson…
For a submanifold with flat normal bundle in a space form there is a normal orthonormal basis that simultaneously diagonalizes the corresponding Weingarten operators, and at which these operators satisfy a simple Codazzi symmetry. When the…
We identify the Variational Principle governing inifinity-Harmonic maps, that is solutions to the Infinity-Laplacian. The system was first derived in the limit of the p-Laplacian as p->inifinity in [K2] and is recently studied in [K3]. Here…
Conformal geodesics are distinguished curves on a conformal manifold, loosely analogous to geodesics of Riemannian geometry. One definition of them is as solutions to a third order differential equation determined by the conformal…
The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The…
It was proved by Graham and Witten in 1999 that conformal invariants of submanifolds can be obtained via volume renormalization of minimal surfaces in conformally compact Einstein manifolds. The conformal invariant of a submanifold $\Sigma$…
This work provides a characterization of the regularity of noncharacteristic intrinsic minimal graphs for a class of vector fields that includes non nilpotent Lie algebras as the one given by Euclidean motions of the plane. The main result…
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph…
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…
We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…