English
Related papers

Related papers: Pinched exponential volume growth implies an infin…

200 papers

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an…

Differential Geometry · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias , William P. Thurston

For any closed orientable 3-manifold, there is a volume function defined on the space of all Seifert representations of the fundamental group. The maximum absolute value of this function agrees with the Seifert volume of the manifold due to…

Geometric Topology · Mathematics 2024-03-06 Pierre Derbez , Yi Liu , Shicheng Wang

The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…

Metric Geometry · Mathematics 2020-10-06 Radosław K. Wojciechowski

In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and…

Differential Geometry · Mathematics 2017-12-06 Bobo Hua , Florentin Münch

In this paper, we firstly verify that if $M$ is a complete self-shrinker with polynomial volume growth in $\mathbb{R}^{n+1}$, and if the squared norm of the second fundamental form of $M$ satisfies $0\leq|A|^2-1\leq\frac{1}{18}$, then…

Differential Geometry · Mathematics 2017-12-07 Li Lei , Hongwei Xu , Zhiyuan Xu

It is a well known fact that in $\mathbb{R}^n$ a subset of minimal perimeter $L$ among all sets of a given volume is also a set of maximal volume among all sets of the same perimeter $L$. This is called the reciprocity principle for…

Analysis of PDEs · Mathematics 2018-03-29 Michael Bildhauer , Martin Fuchs , Jan Mueller

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

Combinatorics · Mathematics 2025-05-16 Vladimir N. Potapov

Let $f$ be a $C^{1}$ diffeomorphism on a compact manifold $M$ admitting a partially hyperbolic splitting $TM=E^{s}\oplus_{\prec} E^{1}\oplus_{\prec} E^{2}\cdots \oplus_{\prec}E^{l}\oplus_{\prec} E^{u}$ where $E^{s}$ is uniformly…

Dynamical Systems · Mathematics 2020-12-15 Dawei Yang , Yuntao Zang

We show that there is an absolute constant $c>0$ such that the following holds. For every $n > 1$, there is a 5-uniform hypergraph on at least $2^{2^{cn^{1/4}}}$ vertices with independence number at most $n$, where every set of 6 vertices…

Combinatorics · Mathematics 2020-03-03 Dhruv Mubayi , Andrew Suk , Emily Zhu

In this paper, we study deeply geometric and topological properties of Finsler metric measure manifolds with the integral weighted Ricci curvature bounds. We first establish Laplacian comparison theorem, Bishop-Gromov type volume comparison…

Differential Geometry · Mathematics 2025-01-22 Xinyue Cheng , Yalu Feng

In this paper, we establish Buser type inequalities, i.e., upper bounds for eigenvalues in terms of Cheeger constants. We prove the Buser's inequality for an infinite but locally finite connected graph with Ricci curvature lower bounds.…

Differential Geometry · Mathematics 2018-10-30 Shuang Liu

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if…

Spectral Theory · Mathematics 2012-09-25 Frank Bauer , Matthias Keller , Radosław K. Wojciechowski

In this paper we consider a ``flow'' of nonparametric solutions of the volume constrained Plateau problem with respect to a convex planar curve. Existence and regularity is obtained from standard elliptic theory, and convexity results for…

Differential Geometry · Mathematics 2016-09-07 John McCuan

We establish the Noether inequality for projective $3$-folds. More precisely, we prove that the inequality $${\rm vol}(X)\geq \tfrac{4}{3}p_g(X)-{\tfrac{10}{3}}$$ holds for all projective $3$-folds $X$ of general type with either…

Algebraic Geometry · Mathematics 2020-06-09 Jungkai A. Chen , Meng Chen , Chen Jiang

In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a conically bounded convex set, i.e., an unbounded convex body admitting an \emph{exterior} asymptotic cone. Results…

Differential Geometry · Mathematics 2014-10-15 Manuel Ritoré , Efstratios Vernadakis

We consider $C^2$ Fr\'echet differentiable mappings of Banach spaces leaving invariant compactly supported Borel probability measures, and study the relation between entropy and volume growth for a natural notion of volume defined on finite…

Dynamical Systems · Mathematics 2015-10-16 Alex Blumenthal , Lai-Sang Young

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Functional Analysis · Mathematics 2025-04-04 Michael Anshelevich , Anh Nguyen

We prove the following isoperimetric-type inequality: for every convex body $K$ in $\mathbb R^n$ and some $\sigma\subset[n]:=\{1,\dots,n\}$ there exists a suitable Hanner polytope $B_K$ with the same volume as $K$ and such that the volume…

Metric Geometry · Mathematics 2026-01-22 Luis J. Alías , Bernardo González Merino , Beatriz Marín Gimeno

We consider the eccentric graph of a graph $G$, denoted by $ecc(G)$, which has the same vertex set as $G$, and two vertices in the eccentric graph are adjacent iff their distance in $G$ is equal to the eccentricity of one of them. In this…

Combinatorics · Mathematics 2024-07-30 Sezer Sorgun , Esma Elyemani

K\H onig's theorem says that the vertex cover number of every bipartite graph is at most its matching number (in fact they are equal since, trivially, the matching number is at most the vertex cover number). An equivalent formulation of K\H…

Combinatorics · Mathematics 2025-04-03 Louis DeBiasio , António Girão , Penny Haxell , Maya Stein