On Mappings on the Hypercube with Small Average Stretch

From MaRDI portal



Abstract: Let Asubseteq0,1n be a set of size 2n−1, and let phicolon0,1n−1oA be a bijection. We define the average stretch of phi as sfavgStretch(phi)=mathbbE[sfdist(phi(x),phi(x′))], where the expectation is taken over uniformly random x,x′in0,1n−1 that differ in exactly one coordinate. In this paper we continue the line of research studying mappings on the discrete hypercube with small average stretch. We prove the following results. (1) For any set Asubseteq0,1n of density 1/2 there exists a bijection phiAcolon0,1n−1oA such that sfavgstretch(phiA)=O(sqrtn). (2) For n=3k let Asfrecext−maj=xin0,1n:sfrecext−maj(x)=1, where sfrecext−maj:0,1no0,1 is the function recursive majority of 3's. There exists a bijection phisfrecext−majcolon0,1n−1oAsfrecext−maj such that sfavgstretch(phisfrecext−maj)=O(1). (3) Let Asftribes=xin0,1n:sftribes(x)=1. There exists a bijection phisftribescolon0,1n−1oAsftribes such that sfavgstretch(phisftribes)=O(log(n)). These results answer the questions raised by Benjamini et al. (FOCS 2014).














This page was built for publication: On Mappings on the Hypercube with Small Average Stretch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6319454)