English
Related papers

Related papers: The Nitsche--Hopf conjecture for minimal graphs

200 papers

In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…

Probability · Mathematics 2025-10-30 Laurent Massoulié

A graph of order $n$ is said to be $k$-\emph{factor-critical} $(0\le k<n)$ if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not $k$-factor-critical…

Combinatorics · Mathematics 2026-03-12 Kevin Pereyra

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Combinatorics · Mathematics 2007-07-18 Matthew Baker , Serguei Norine

We derive the L\'evy-Khintchine representation of the Wiener-Hopf factors for the Normal Inverse Gaussian (NIG) process as well as a representation which is similar to the moment generating function (MGF) of a generalized gamma convolution…

Probability · Mathematics 2019-02-28 Daniel Hackmann

A weighted area estimate for entire graphs with bounded weighted mean curvature in Gauss space is given by a simple proof. Bernstein type theorems for self shrinkers (\cite {wa}) as well as for graphic $\lambda$-hypersurfaces (\cite{…

Differential Geometry · Mathematics 2018-03-02 Doan The Hieu

We investigate the problem $\#\mathsf{IndSub}(\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be…

Computational Complexity · Computer Science 2018-07-06 Marc Roth , Johannes Schmitt

We prove that an anisotropic minimal graph over a half-space with flat boundary must itself be flat. This generalizes a result of Edelen-Wang to the anisotropic case. The proof uses only the maximum principle and ideas from fully nonlinear…

Analysis of PDEs · Mathematics 2023-12-13 Wenkui Du , Connor Mooney , Yang Yang , Jingze Zhu

We prove a flatness result for entire nonlocal minimal graphs having some partial derivatives bounded from either above or below. This result generalizes fractional versions of classical theorems due to Bernstein and Moser. Our arguments…

Analysis of PDEs · Mathematics 2018-12-06 Matteo Cozzi , Alberto Farina , Luca Lombardini

Let $\gamma$ be a bounded convex curve on a plane. Then $\sharp (\gamma\cap (\Z/n)^2)=o(n^{2/3})$. It streghtens the classical result of Jarn\'\i k (an upper estimate $O(n^{2/3})$) and disproves a conjecture of Vershik on existence of the…

Number Theory · Mathematics 2007-05-23 Fedor V. Petrov

In SoCG 2022, Conroy and T\'oth presented several constructions of sparse, low-hop spanners in geometric intersection graphs, including an $O(n\log n)$-size 3-hop spanner for $n$ disks (or fat convex objects) in the plane, and an $O(n\log^2…

Computational Geometry · Computer Science 2023-03-30 Timothy M. Chan , Zhengcheng Huang

We explore the notion of m-intermediate Ricci curvature assumption introduced by Brendle-Hirsch-Johne further. If a manifold has non-negative m-intermediate Ricci curvature and stable weighted slicing of order m-1, then the last slice has…

Differential Geometry · Mathematics 2025-10-14 Yujie Wu

We prove that for $k+1\geq 3$ and $c>(k+1)/2$ w.h.p. the random graph on $n$ vertices, $cn$ edges and minimum degree $k+1$ contains a (near) perfect $k$-matching. As an immediate consequence we get that w.h.p. the $(k+1)$-core of $G_{n,p}$,…

Combinatorics · Mathematics 2021-07-09 Michael Anastos

Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…

Combinatorics · Mathematics 2016-09-06 Madhav V. Marathe , H. Breu , Harry B. Hunt , S. S. Ravi , Daniel J. Rosenkrantz

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…

Combinatorics · Mathematics 2020-01-17 Joonkyung Lee , Bjarne Schülke

Inspired by the work of Cordero-Erausquin, McCann and Schmuckenschl\"ager [{\it Invent. Math.,} 2001], we derive an explicit expression for the Jacobian determinant of the normal exponential map on a submanifold, establishing a relationship…

Differential Geometry · Mathematics 2026-05-08 Shengliang Pan , Chengyang Yi

This is a set of working notes which give a second proof of the Shareshian--Wachs conjecture, the first (and recent) proof being by Brosnan and Chow in November 2015. The conjecture relates some symmetric functions constructed…

Combinatorics · Mathematics 2016-01-22 Mathieu Guay-Paquet

In this paper, we study the differential inclusion associated to the minimal surface system for two-dimensional graphs in $\mathbb{R}^{2 + n}$. We prove regularity of $W^{1,2}$ solutions and a compactness result for approximate solutions of…

Analysis of PDEs · Mathematics 2020-03-18 Riccardo Tione

Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…

Probability · Mathematics 2023-05-30 Xiao Fang , Yuta Koike

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

Computational Geometry · Computer Science 2018-02-27 Boris Aronov , Anirudh Donakonda , Esther Ezra , Rom Pinchasi

A unit disk graph $G$ on a given set $P$ of points in the plane is a geometric graph where an edge exists between two points $p,q \in P$ if and only if $|pq| \leq 1$. A spanning subgraph $G'$ of $G$ is a $k$-hop spanner if and only if for…

Computational Geometry · Computer Science 2021-02-08 Adrian Dumitrescu , Anirban Ghosh , Csaba D. Tóth