English
Related papers

Related papers: Isoperimetric Inequalities for Ramanujan Complexes…

200 papers

A result of Boros and F\"uredi ($d=2$) and of B\'ar\'any (arbitrary $d$) asserts that for every $d$ there exists $c_d>0$ such that for every $n$-point set $P\subset \R^d$, some point of $\R^d$ is covered by at least $c_d{n\choose d+1}$ of…

Combinatorics · Mathematics 2016-08-14 Jiří Matoušek , Uli Wagner

Borel summable semiclassical expansions in 1D quantum mechanics are considered. These are the Borel summable expansions of fundamental solutions and of quantities constructed with their help. An expansion, called topological,is constructed…

Quantum Physics · Physics 2008-11-26 Stefan Giller

We revisit the isoperimetric inequalities for finitely generated groups introduced and studied by N. Varopoulos, T. Coulhon and L. Saloff-Coste. Namely we show that a lower bound on the isoperimetric quotient of finite subsets in a finitely…

Group Theory · Mathematics 2023-08-30 Bruno Luiz Santos Correia , Marc Troyanov

We investigate the interaction between systolic geometry and positive scalar curvature through spinorial methods. Our main theorem establishes an upper bound for the two-dimensional stable systole on certain high-dimensional manifolds with…

Differential Geometry · Mathematics 2025-09-30 Shunichiro Orikasa

An extension $B\subset A$ of finite dimensional algebras is bounded if the $B$-$B$-bimodule $A/B$ is $B$-tensor nilpotent, its projective dimension is finite and $\mathrm{Tor}_i^B(A/B, (A/B)^{\otimes_B j})=0$ for all $i, j\geq 1$. We show…

Representation Theory · Mathematics 2024-08-26 Yongyun Qin , Xiaoxiao Xu , Jinbi Zhang , Guodong Zhou

Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph $G$ with minimum degree $\delta \ge 2m+2 \ge 4$ satisfies $\lambda_2(G) < \delta - \frac{2m+1}{\delta+1}$, then $G$ contains at least $m+1$…

Combinatorics · Mathematics 2021-04-06 Sebastian M. Cioabă , Anthony Ostuni , Davin Park , Sriya Potluri , Tanay Wakhare , Wiseley Wong

Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…

Logic in Computer Science · Computer Science 2024-08-07 Édouard Bonnet , Jaroslav Nešetřil , Patrice Ossona de Mendez , Sebastian Siebertz , Stéphan Thomassé

We give model-independent arguments, valid in nearly any number of spacetime dimensions, that topological solitons and instantons satisfy Bogomol'nyi-type bounds and, when these bounds are saturated, satisfy self-duality equations. In the…

High Energy Physics - Theory · Physics 2009-10-22 Zvonimir Hlousek , Donald Spector

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget

The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…

General Relativity and Quantum Cosmology · Physics 2018-02-15 Edward Anderson

For every $d\ge 3$, we construct a noncompact smooth $d$-dimensional Riemannian manifold with strictly positive sectional curvature without isoperimetric sets for any volume below $1$. We construct a similar example also for the relative…

Differential Geometry · Mathematics 2024-05-30 Gioacchino Antonelli , Federico Glaudo

We compute a primary cohomological obstruction to the existence of an equipartition for j mass distributions in R^d by two hyperplanes in the case 2d-3j = 1. The central new result is that such an equipartition always exists if d=6 2^k +2…

Metric Geometry · Mathematics 2014-03-03 Rade T. Zivaljevic

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg

We show that expander graphs must have Gromov-hyperbolicity at least proportional to their diameter, with a constant of proportionality depending only on the expansion constant and maximal degree. In other words, expanders contain geodesic…

Combinatorics · Mathematics 2015-02-26 Anton Malyshev

In this paper we consider the degree/diameter problem, namely, given natural numbers {\Delta} \geq 2 and D \geq 1, find the maximum number N({\Delta},D) of vertices in a graph of maximum degree {\Delta} and diameter D. In this context, the…

Combinatorics · Mathematics 2014-05-06 Ramiro Feria-Purón , Mirka Miller , Guillermo Pineda-Villavicencio

In the celebrated book entitled Metric Structures for Riemannian and Non-Riemannian Spaces, so-called Green Book, Gromov presented a problem regarding a metric measure space. Gromov posed the question Bound the expansion coefficient from…

Differential Geometry · Mathematics 2016-11-18 Ushio Tanaka

Almost hypercomplex manifolds with Hermitian and anti-Hermitian metrics are considered. A linear connection $D$ is introduced such that the structure of these manifolds is parallel with respect to D. Of special interest is the class of the…

Differential Geometry · Mathematics 2012-05-08 Mancho Manev

We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive $b_2$ obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions…

Group Theory · Mathematics 2015-11-03 Danny Calegari , Alden Walker

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

Differential Geometry · Mathematics 2022-08-30 Gioacchino Antonelli , Stefano Nardulli , Marco Pozzetta