English
Related papers

Related papers: Locally isoperimetric partitions

200 papers

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

Combinatorics · Mathematics 2010-12-01 Norbert Sauer

We construct isoperimetric regions from separating hypersurfaces in closed manifolds. This yields isoperimetric boundaries exhibiting a wide variety of topological types and singular sets.

Differential Geometry · Mathematics 2026-03-16 Kobe Marshall-Stevens , Gongping Niu

In this paper we define a notion of S-extension for a metric space and study minimality and coherence of S-extensions. We show that every S-extension can be identified with an algebraic object. We use this algebraic representation to give a…

Logic · Mathematics 2021-04-21 Mahmood Etedadialiabadi , Su Gao

We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…

Functional Analysis · Mathematics 2024-02-08 Rubén Medina , Andrés Quilis

This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\it minimum normalized cuts}/{\it isoperimteric…

Computational Complexity · Computer Science 2010-09-06 Amir Daneshgar , Ramin Javadi

We study harmonic and quasi-harmonic discs in metric spaces admitting a uniformly local quadratic isoperimetric inequality for curves. The class of such metric spaces includes compact Lipschitz manifolds, metric spaces with upper or lower…

Analysis of PDEs · Mathematics 2015-12-04 Alexander Lytchak , Stefan Wenger

We prove a vertex isoperimetric inequality for the $n$-dimensional Hamming ball $\mathcal{B}_n(R)$ of radius $R$. The isoperimetric inequality is sharp up to a constant factor for sets that are comparable to $\mathcal{B}_n(R)$ in size. A…

Combinatorics · Mathematics 2022-02-10 Zilin Jiang , Amir Yehudayoff

We prove that on an essentially non-branching $\mathrm{MCP}(K,N)$ space, if a geodesic ball has a volume lower bound and satisfies some additional geometric conditions, then in a smaller geodesic ball (in a quantified sense) we have an…

Metric Geometry · Mathematics 2021-09-17 Xian-Tao Huang

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary…

Mathematical Physics · Physics 2015-05-14 Cedric Boutillier , Sevak Mkrtchyan , Nicolai Reshetikhin , Peter Tingley

We consider the problem of finding a local optimum for Max-Cut with FLIP-neighborhood, in which exactly one node changes the partition. Schaeffer and Yannakakis (SICOMP, 1991) showed PLS-completeness of this problem on graphs with unbounded…

Computational Complexity · Computer Science 2011-06-27 Robert Elsaesser , Tobias Tscheuschner

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

Combinatorics · Mathematics 2023-09-06 Hunter Waldron

We highlight a topological aspect of the graph limit theory. Graphons are limit objects for convergent sequences of dense graphs. We introduce the representation of a graphon on a unique metric space and we relate the dimension of this…

Combinatorics · Mathematics 2010-02-24 László Lovász , Balázs Szegedy

A left invariant metric on a nilpotent Lie group is called minimal, if it minimizes the norm of the Ricci tensor among all left invariant metrics with the same scalar curvature. Such metrics are unique up to isometry and scaling and the…

Differential Geometry · Mathematics 2007-05-23 Jorge Lauret

Certain numerical methods for initial value problems have as stability function the nth partial sum of the exponential function. We study the stability region, i.e., the set in the complex plane over which the nth partial sum has at most…

Numerical Analysis · Mathematics 2013-12-03 David Ketcheson , Tihamér A. Kocsis , Lajos Lóczi

In the present paper we deal with (local) infinitesimal isometries of special sub-Riemannian manifolds (a contact and oriented sub-Riemannian manifold is called special if the Reeb vector field is an isometry). The objective of the paper is…

Differential Geometry · Mathematics 2024-10-02 Marek Grochowski

Consider the partition function S(\epsilon) associated in theory of Renyi dimension to a finite Borel measure \mu on Euclidean d-space. This partion function S(\epsilon) is the sum of the q-th powers of the measure applied to a partition of…

Functional Analysis · Mathematics 2011-11-09 Terry A. Loring

We show that every isoperimetric set in R^N with density is bounded if the density is continuous and bounded by above and below. This improves the previously known boundedness results, which basically needed a Lipschitz assumption; on the…

Functional Analysis · Mathematics 2012-09-18 Eleonora Cinti , Aldo Pratelli

We investigate the geometry of the family $\cal M$ of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We show that sufficiently small neighborhoods of generic finite spaces in the subspace of all finite…

Metric Geometry · Mathematics 2016-04-27 Stavros Iliadis , Alexander Ivanov , Alexey Tuzhilin

We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…

Computational Geometry · Computer Science 2023-06-30 Sanjana Dey , Florent Foucaud , Subhas C Nandy , Arunabha Sen