English
Related papers

Related papers: Separating cycles and isoperimetric inequalities i…

200 papers

We prove that the random simple cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices admits a novel uniform infinite cubic planar graph (UICPG) as quenched local limit. We describe how the limit may be constructed by a…

Probability · Mathematics 2022-02-02 Benedikt Stufler

We develop a method to compute the generating function of the number of vertices inside certain regions of the Uniform Infinite Planar Triangulation (UIPT). The computations are mostly combinatorial in flavor and the main tool is the…

Probability · Mathematics 2020-03-16 Laurent Ménard

We consider entire transcendental maps with bounded set of singular values such that periodic rays exist and land. For such maps, we prove a refined version of the Fatou-Shishikura inequality which takes into account rationally invisible…

Dynamical Systems · Mathematics 2019-07-30 Anna Miriam Benini , Núria Fagella

It follows from a general theorem of Bonk and Eremenko that closed plane curves which are contractible in the complement to the integral lattice satisfy a linear isoperimetric inequality. We give an alternative proof of this fact. Our…

Group Theory · Mathematics 2007-05-23 Leonid Polterovich , Jean-Claude Sikorav

The discrete isoperimetric inequality states that among all n -gons with a fixed area, the regular n -gon has the least perimeter. We prove analogues of the discrete isoperimetric inequality (involving circumradius or inradius) for cyclic…

Geometric Topology · Mathematics 2025-04-08 Subash Chandra Behera , Shiv Parsad

The classical isoperimetric inequality can be extended to a general normed plane. In the Euclidean plane, the defect in the isoperimetric inequality can be calculated in terms of the signed areas of some singular sets. In this paper we…

Metric Geometry · Mathematics 2020-10-23 Rafael Segadas dos Santos , Marcos Craizer

We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural…

Probability · Mathematics 2016-01-05 Omer Angel , Gourab Ray

We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…

Probability · Mathematics 2023-11-08 Thomas Budzinski , Guillaume Chapuy , Baptiste Louf

We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem…

Databases · Computer Science 2019-04-02 Pablo Barceló , Diego Figueira , Miguel Romero

We consider a Markov evolution of lozenge tilings of a quarter-plane and study its asymptotics at large times. One of the boundary rays serves as a reflecting wall. We observe frozen and liquid regions, prove convergence of the local…

Representation Theory · Mathematics 2011-03-08 Alexei Borodin , Jeffrey Kuan

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…

Probability · Mathematics 2011-01-10 Pieter Trapman

We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…

Metric Geometry · Mathematics 2016-06-30 Grigoris Paouris , Peter Pivovarov

Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit…

Probability · Mathematics 2007-05-23 Philippe Chassaing , Bergfinnur Durhuus

The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…

Mathematical Physics · Physics 2026-05-29 Malo Hillairet

We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any…

Metric Geometry · Mathematics 2016-04-21 Omer Angel , Itai Benjamini , Nizan Horesh

We fully characterize the set of finite shapes with minimal perimeter on hyperbolic lattices given by regular tilings of the hyperbolic plane whose tiles are regular $p$-gons meeting at vertices of degree $q$, with $1/p+1/q<\frac{1}{2}$. In…

Combinatorics · Mathematics 2026-05-08 Matteo D'Achille , Vanessa Jacquier , Wioletta M. Ruszel

We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well…

Probability · Mathematics 2021-05-12 Thomas Lehéricy

A recent preprint (arXiv:1402.2632) introduced a growth procedure for planar maps, whose almost sure limit is "the uniform infinite 3-connected planar map". A classical construction of Brooks, Smith, Stone and Tutte (1940) associates a…

Probability · Mathematics 2014-05-20 Louigi Addario-Berry , Nicholas Leavitt

The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied. In particular, the limit is a probability measure on random…

Probability · Mathematics 2009-11-07 Omer Angel , Oded Schramm

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…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias