English

Vertical perimeter versus horizontal perimeter

Metric Geometry 2018-03-14 v2 Data Structures and Algorithms Classical Analysis and ODEs Combinatorics Functional Analysis

Abstract

The discrete Heisenberg group HZ2k+1\mathbb{H}_{\mathbb{Z}}^{2k+1} is the group generated by a1,b1,,ak,bk,ca_1,b_1,\ldots,a_k,b_k,c, subject to the relations [a1,b1]==[ak,bk]=c[a_1,b_1]=\ldots=[a_k,b_k]=c and [ai,aj]=[bi,bj]=[ai,bj]=[ai,c]=[bi,c]=1[a_i,a_j]=[b_i,b_j]=[a_i,b_j]=[a_i,c]=[b_i,c]=1 for every distinct i,j{1,,k}i,j\in \{1,\ldots,k\}. Denote S={a1±1,b1±1,,ak±1,bk±1}S=\{a_1^{\pm 1},b_1^{\pm 1},\ldots,a_k^{\pm 1},b_k^{\pm 1}\}. The horizontal boundary of ΩHZ2k+1\Omega\subset \mathbb{H}_{\mathbb{Z}}^{2k+1}, denoted hΩ\partial_{h}\Omega, is the set of all (x,y)Ω×(HZ2k+1Ω)(x,y)\in \Omega\times (\mathbb{H}_{\mathbb{Z}}^{2k+1}\setminus \Omega) such that x1ySx^{-1}y\in S. The horizontal perimeter of Ω\Omega is hΩ|\partial_{h}\Omega|. For tNt\in \mathbb{N}, define vtΩ\partial^t_{v} \Omega to be the set of all (x,y)Ω×(HZ2k+1Ω)(x,y)\in \Omega\times (\mathbb{H}_{\mathsf{Z}}^{2k+1}\setminus \Omega) such that x1y{ct,ct}x^{-1}y\in \{c^t,c^{-t}\}. The vertical perimeter of Ω\Omega is defined by vΩ=t=1vtΩ2/t2|\partial_{v}\Omega|= \sqrt{\sum_{t=1}^\infty |\partial^t_{v}\Omega|^2/t^2}. It is shown here that if k2k\ge 2, then vΩ1khΩ|\partial_{v}\Omega|\lesssim \frac{1}{k} |\partial_{h}\Omega|. The proof of this "vertical versus horizontal isoperimetric inequality" uses a new structural result that decomposes sets of finite perimeter in the Heisenberg group into pieces that admit an "intrinsic corona decomposition." This allows one to deduce an endpoint W1,1L2(L1)W^{1,1}\to L_2(L_1) boundedness of a certain singular integral operator from a corresponding lower-dimensional W1,2L2(L2)W^{1,2}\to L_2(L_2) boundedness. The above inequality has several applications, including that any embedding into L1L_1 of a ball of radius nn in the word metric on HZ5\mathbb{H}_{\mathbb{Z}}^{5} incurs bi-Lipschitz distortion that is at least a constant multiple of logn\sqrt{\log n}. It follows that the integrality gap of the Goemans--Linial semidefinite program for the Sparsest Cut Problem on inputs of size nn is at least a constant multiple of logn\sqrt{\log n}.

Keywords

Cite

@article{arxiv.1701.00620,
  title  = {Vertical perimeter versus horizontal perimeter},
  author = {Assaf Naor and Robert Young},
  journal= {arXiv preprint arXiv:1701.00620},
  year   = {2018}
}

Comments

suggestions of referees addressed

R2 v1 2026-06-22T17:39:48.546Z