Large sets of nearly orthogonal vectors (Q1288511): Difference between revisions

For positive integers \(d\), \(k\) and \(l\), let \(\alpha(d,k,l)\) denote the cardinality of a largest set of nonzero vectors in \(\mathbb{R}^d\) such that any \((k+1)\)-element subset contains \(l+1\) pairwise orthogonal vectors. For example \(\alpha(d,2,1)= 2d\) and \(\alpha(2,k,1)= 2k\). This paper is devoted to a proof of: Theorem 1.1. For every \(l\geq 1\) there exists an \(\varepsilon= \varepsilon_l> 0\) such that for every positive integer \(t\) divisible by 4 and satisfying \(t>l\), and for every positive integer \(s\), if \(d= t^s\) and \(k= \lfloor 2^{t+1}/(\varepsilon t)\rfloor\), then \(\alpha(d,k,l)\geq 2^{\varepsilon ts/2}\).