Vertical perimeter versus horizontal perimeter

January 03, 2017 Β· Declared Dead Β· πŸ› Annals of Mathematics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Assaf Naor, Robert Young arXiv ID 1701.00620 Category math.MG Cross-listed cs.DS, math.CA, math.CO, math.FA Citations 67 Venue Annals of Mathematics Last Checked 3 months ago
Abstract
The discrete Heisenberg group $\mathbb{H}_{\mathbb{Z}}^{2k+1}$ is the group generated by $a_1,b_1,\ldots,a_k,b_k,c$, subject to the relations $[a_1,b_1]=\ldots=[a_k,b_k]=c$ and $[a_i,a_j]=[b_i,b_j]=[a_i,b_j]=[a_i,c]=[b_i,c]=1$ for every distinct $i,j\in \{1,\ldots,k\}$. Denote $S=\{a_1^{\pm 1},b_1^{\pm 1},\ldots,a_k^{\pm 1},b_k^{\pm 1}\}$. The horizontal boundary of $Ξ©\subset \mathbb{H}_{\mathbb{Z}}^{2k+1}$, denoted $\partial_{h}Ξ©$, is the set of all $(x,y)\in Ξ©\times (\mathbb{H}_{\mathbb{Z}}^{2k+1}\setminus Ξ©)$ such that $x^{-1}y\in S$. The horizontal perimeter of $Ξ©$ is $|\partial_{h}Ξ©|$. For $t\in \mathbb{N}$, define $\partial^t_{v} Ξ©$ to be the set of all $(x,y)\in Ξ©\times (\mathbb{H}_{\mathsf{Z}}^{2k+1}\setminus Ξ©)$ such that $x^{-1}y\in \{c^t,c^{-t}\}$. The vertical perimeter of $Ξ©$ is defined by $|\partial_{v}Ξ©|= \sqrt{\sum_{t=1}^\infty |\partial^t_{v}Ξ©|^2/t^2}$. It is shown here that if $k\ge 2$, then $|\partial_{v}Ξ©|\lesssim \frac{1}{k} |\partial_{h}Ξ©|$. 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 $W^{1,1}\to L_2(L_1)$ boundedness of a certain singular integral operator from a corresponding lower-dimensional $W^{1,2}\to L_2(L_2)$ boundedness. The above inequality has several applications, including that any embedding into $L_1$ of a ball of radius $n$ in the word metric on $\mathbb{H}_{\mathbb{Z}}^{5}$ incurs bi-Lipschitz distortion that is at least a constant multiple of $\sqrt{\log n}$. It follows that the integrality gap of the Goemans--Linial semidefinite program for the Sparsest Cut Problem on inputs of size $n$ is at least a constant multiple of $\sqrt{\log n}$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.MG

R.I.P. πŸ‘» Ghosted

Packings in real projective spaces

Matthew Fickus, John Jasper, Dustin G. Mixon

math.MG πŸ› SIAM Journal on applied algebra and geometry πŸ“š 34 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted