相关论文: Edge-Isoperimetric Inequalities in Chamber Graphs …

We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with $k$-dilation. Suppose $U$ is an open set in $\mathbb{R}^n$ diffeomorphic to a Euclidean $n$-ball. We show that in…

We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…

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…

Let $Q_{n}^{r}$ be the graph with vertex set $\{-1,1\}^{n}$ in which two vertices are joined if their Hamming distance is at most $r$. The edge-isoperimetric problem for $Q_{n}^{r}$ is that: For every $(n,r,M)$ such that $1\le r\le n$ and…

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…

We prove an isoperimetric inequality for conjugation-invariant sets of size $k$ in $S_n$, showing that these necessarily have edge-boundary considerably larger than some other sets of size $k$ (provided $k$ is small). Specifically, let…

We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…

We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for…

We consider the edge-isoperimetric problem on the graph of the infinite grid $\mathbb{N}^{2}$ in the $\ell_{\infty}$ metric. We first show that the solutions are not nested, so that techniques other than compressions have to be used. We…

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…

Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…

We study a class of edge-coloured graphs, including the chamber systems of buildings and other geometries such as affine planes, from which we build coherent configurations (also known as non-commutative association schemes). The condition…

We construct inhomogeneous isoparametric families of hypersurfaces with non-austere focal set on each symmetric space of non-compact type and rank greater than or equal to 3. If the rank is greater than or equal to 4, there are infinitely…

Gromov's isoperimetric gap conjecture for Hadamard spaces states that cycles in dimensions greater than or equal to the asymptotic rank admit linear isoperimetric filling inequalities, as opposed to the inequalities of Euclidean type in…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

We prove general theorems for isoperimetric problems on lattices of the form ${\mathbb{Z}}^{k} \times {\mathbb{N}}^{d}$ which state that the perimeter of the optimal set is a monotonically increasing function of the volume under certain…

We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…