相关论文: The first Cheeger constant of a simplex

We study several aspects of the $k$-th Cheeger constant of a complex X, a parameter that quantifies the distance of $X$ from a complex $Y$ with nontrivial $k$-th cohomology over $\mathbb{Z}_2$. Our results include general methods for…

The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a…

We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations $\Sigma(x_1,\dots,x_n)=0$ in $m$ derivatives over a differential field of characteristic zero, is there a computable bound, that…

Recently, hypergraphs have attracted a lot of attention due to their ability to capture complex relations among entities. The insurgence of hypergraphs has resulted in data of increasing size and complexity that exhibit interesting…

In this paper, we introduce Cheeger type constants via isocapacitary constants introduced by Maz'ya to estimate first Dirichlet, Neumann and Steklov eigenvalues on a finite subgraph of a graph. Moreover, we estimate the bottom of the…

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…

We establish that \[\sum_{m=1}^\infty \sum_{n=1}^\infty a_m \overline{a_n} \frac{mn}{(\max(m,n))^3} \leq \frac{4}{3}\sum_{m=1}^\infty |a_m|^2\] holds for every square-summable sequence of complex numbers $a = (a_1,a_2,\ldots)$ and that the…

This note details how a recent structure theorem for normal $1$-currents proved by the first and third author allows to prove a conjecture of Cheeger concerning the structure of Lipschitz differentiability spaces. More precisely, we show…

Let $\Gamma$ be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Denote the degree of $\Gamma$ by $d$, its edge Cheeger constant by $\mathfrak{h}_\Gamma$, and its…

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

By using the Szemer\'edi Regularity Lemma, Alon and Sudakov recently extended the classical Andr\'asfai-Erd\~os-S\'os theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is…

The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smallest eigenvalue of its normalized Laplacian, is a cornerstone of spectral graph theory. The Cheeger inequality has been…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta_{\mathrm{sub}}(n, H)$ be the smallest integer…

Let A be a finite subset of an abelian group (G, +). Let h $\ge$ 2 be an integer. If |A| $\ge$ 2 and the cardinality |hA| of the h-fold iterated sumset hA = A + $\times$ $\times$ $\times$ + A is known, what can one say about |(h -- 1)A| and…

This paper investigates links between the eigenvalues and eigenfunctions of the Laplace-Beltrami operator, and the higher Cheeger constants of smooth Riemannian manifolds, possibly weighted and/or with boundary. The higher Cheeger constants…

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every graph G with n vertices and m > n^{1+epsilon} edges, has a…

Let $G$ be a graph of genus $g$ with boundary $\delta\Omega$. For $g=0$, Lin and Zhao [J. Lond. Math. Soc. 112 (2025), Paper No. e70238] proved an upper bound for the first (non-trivial) Steklov eigenvalue of $(G, \delta\Omega )$, and they…

We study the minimal surface equation in the Heisenberg space, Nil_3. A geometric proof of non existence of minimal graphs over non convex, bounded and unbounded domains is achieved (our proof holds in the Euclidean space as well). We solve…