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

Let S be a C^2 H-minimal noncharacteristic hypersurface in the first Heisenberg group. We show that if S contains a graphical strip, then it is not a stable minimal surface. Moreover, we show that if S is a C^2 H-minimal noncharacteristic…

We prove that entire solutions of the minimal hypersurface equation \[ \mathrm{div}\left(\frac{Du}{\sqrt{1+|Du|^2}}\right) = 0 \] on a complete manifold with $\mathrm{Ric} \ge 0$, whose negative part grows like $\mathcal{O}(r/\log r)$ ($r$…

In the biharmonic submanifolds theory there is a generalized Chen's conjecture which states that biharmonic submanifolds in a Riemannian manifold with non-positive sectional curvature must be minimal. This conjecture turned out false by a…

As the first step in the direction of the Hopf conjecture on the non-existence of metrics with positive sectional curvature on $S^2 \times S^2$ D.Gromoll and K.Tapp in [GT] suggested the following (Weak Hopf) conjecture (on the rigidity of…

This paper extends the foundational reflection theory of Nichols algebras to the setting of some certain coquasi-Hopf algebras. Our primary motivation arises from the classification of pointed finite-dimensional coquasi-Hopf algebras. We…

This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…

Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…

This paper is devoted to studying a topological version of the famous Hedetniemi conjecture which says: The $\mathbb Z/2$-index of the Cartesian product of two $\mathbb Z/2$-spaces is equal to the minimum of their $\mathbb Z/2$-indexes. We…

Graph sampling set selection, where a subset of nodes are chosen to collect samples to reconstruct a smooth graph signal, is a fundamental problem in graph signal processing (GSP). Previous works employ an unbiased least-squares (LS) signal…

In this paper we consider the fundamental problem of approximating the diameter $D$ of directed or undirected graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SIAM J. Comput. 1999] presented an algorithm that computes in…

We investigate the parabolic Cauchy problem associated with quantum graphs including Lipschitz or polynomial type nonlinearities and additive Gaussian noise perturbed vertex conditions. The vertex conditions are the standard continuity and…

Let $u_k(G,p)$ be the maximum over all $k$-vertex graphs $F$ of by how much the number of induced copies of $F$ in $G$ differs from its expectation in the binomial random graph with the same number of vertices as $G$ and with edge…

The Karp--Sipser algorithm consists in removing recursively the leaves as well their unique neighbours and all isolated vertices of a given graph. The remaining graph obtained when there is no leaf left is called the Karp--Sipser core. When…

A random geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_1,\ldots,x_n$ independently and uniformly from the $d$-dimensional unit sphere, then connecting each pair $(i,j)$ with probability $K(\langle…

For any given graph $H$, we are interested in $p_\mathrm{crit}(H)$, the minimal $p$ such that the Erd\H{o}s-R\'enyi graph $G(n,p)$ contains a copy of $H$ with probability at least $1/2$. Kahn and Kalai (2007) conjectured that…

For an approximately central (AC) Powers-Rieffel projection $e$ in the irrational Flip orbifold C*-algebra $A_\theta^\Phi,$ where $\Phi$ is the Flip automorphism of the rotation C*-algebra $A_\theta,$ we compute the Connes-Chern character…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

We obtain a sharp estimate on the norm of the differential of a harmonic map from the unit disc $\mathbb D$ in $\mathbb C$ into the unit ball $\mathbb B^n$ in $\mathbb R^n$, $n\ge 2$, at any point where the map is conformal. In dimension…

The celebrated Hajnal-Szemer\'edi theorem gives the precise minimum degree threshold that forces a graph to contain a perfect K_k-packing. Fischer's conjecture states that the analogous result holds for all multipartite graphs except for…