pith. sign in

arxiv: 1409.7447 · v2 · pith:OH5XQVNPnew · submitted 2014-09-26 · 🧮 math.CO · math.PR

Near invariance of the hypercube

classification 🧮 math.CO math.PR
keywords matriceshypercubeorthogonalalmost-completeapplicationsbooleancharacterizingclose
0
0 comments X
read the original abstract

We give an almost-complete description of orthogonal matrices $M$ of order $n$ that "rotate a non-negligible fraction of the Boolean hypercube $C_n=\{-1,1\}^n$ onto itself," in the sense that $$P_{x\in C_n}(Mx\in C_n) \ge n^{-C},\mbox{ for some positive constant } C,$$ where $x$ is sampled uniformly over $C_n$. In particular, we show that such matrices $M$ must be very close to products of permutation and reflection matrices. This result is a step toward characterizing those orthogonal and unitary matrices with large permanents, a question with applications to linear-optical quantum computing.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.