Related papers: Quadratic isoperimetric inequality for 7-located s…

We prove that $7$-located locally $5$-large simplicial complexes are aspherical.

A sharp quantitative polygonal isoperimetric inequality is obtained.

$m$-location is a local combinatorial condition for flag simplicial complexes introduced by Osajda. Osajda showed that simply connected 8-located locally 5-large complexes are hyperbolic. We treat the nonpositive curvature case of 7-located…

In this paper, we prove that a quartic polynomial solution of the eikonal equation $|\nabla_x f|^2=16x^{6}$ in $\R{n}$ is either an isoparametric polynomial or congruent to a polynomial $f=(\sum_{i=1}^n x_i^2)^2-8(\sum_{i=1}^k…

In this paper, we prove that the fundamental group of a simplicial complex is isomorphic to the algebraic fundamental group of its incidence algebra, and we derive some applications.

Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…

In this paper, we prove some isoperimetric inequalities and give a sharp bound for the positive solution of sublinear elliptic equations.

We show that arithmetic subgroups of semisimple groups of relative Q-type A_n, B_n, C_n, D_n, E_6, or E_7 have an exponential lower bound to their isoperimetric inequality in the dimension that is 1 less than the real rank of the semisimple…

We study the isomorphism types of simply connected complexes of rank 7/4 using a local invariant called the parity. We show that the parity can be computed explicitly in certain constructions arising from surgery.

Cheeger inequality is a classical result emerging from the isoperimetric problem in the field of geometry. In the graph theory, a discrete version of Cheeger inequality was also studied deeply and the notion was further extended for higher…

We show that under certain mild conditions, a metric simplicial complex which satisfies the Ptolemy inequality is a CAT(0) space. Ptolemy's inequality is closely related to inversions of metric spaces. For a large class of metric simplicial…

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

We show that 2-dimensional systolic complexes are quasi-isometric to quadric complexes with flat intervals. We use this fact along with the weight function of Brodzki, Campbell, Guentner, Niblo and Wright to prove that 2-dimensional…

We improve on the spectral large sieve inequality for symmetric-squares. We also prove a lower bound showing that the most optimistic upper bound is not true for this family.

We introduce t-uniform simplicial complexes and we show that the lengths of spheres in such complexes are the terms of certain Lucas sequences. We find optimal constants for the linear isoperimetric inequality in the hyperbolic case.

We prove that the isoperimetric constant is positive for all symmetric spaces of noncompact type and compute it explicitly.

Let $K$ be a locally compact non-discrete field of characteristic $p>2$ and $Q$ be a non-degenerate isotropic binary quadratic form with coefficients in $K$. We obtain asymptotic estimates for the number of solutions in the two-fold product…

We prove a relative isoperimetric inequalities for Lagrangian half disks in $\mathbb{C}^2$ with respect to a Lagrangian plane, or a complex plane, or a union of any two of Lagrangian or complex planes that intersect transversally at the…

We prove isoperimetric inequalities for quotients of $n$-dimensional Affine buildings. We use these inequalities to prove topological overlapping for the 2-dimensional skeletons of these buildings.

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…