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}\).
- On the number of orthogonal systems in vector spaces over finite fields
- Sets of vectors with many orthogonal pairs
- An extremal problem of orthants containing at most one point besides the origin
- Induced-bisecting families of bicolorings for hypergraphs
- Some structural properties of low-rank matrices related to computational complexity
- Flattening rank and its combinatorial applications
- Extendable orthogonal sets of integral vectors
- Almost orthogonal subsets of vector spaces over finite fields
- Almost-equidistant sets
- Nearly orthogonal vectors and small antipodal spherical codes
- Orthonormal representations of \(H\)-free graphs
- A universal partition result for infinite homogeneous K_n-free and related graphs
- The cardinality of sets of \(k\)-independent vectors over finite fields
- Finding a vector orthogonal to roughly half a collection of vectors
- The cylindrical width of transitive sets
- Families of vectors without antipodal pairs
- Orthogonal systems in vector spaces over finite rings
- On the largest subsets avoiding the diameter of (0, 1)-vectors
- Hyperorthogonal family of vectors and the associated Gram matrix
- Note on large subsets of binary vectors with similar distances
- Balancing sets of vectors
- Optimizers of three-point energies and nearly orthogonal sets
- Nearly orthogonal vectors and small antipodal spherical codes
- Orthonormal representations, vector chromatic number, and extension complexity
- On the maximum size of ultrametric orthogonal sets over discrete valued fields
- Inertia, independence and expanders
- Nearly orthogonal sets over finite fields
- Larger nearly orthogonal sets over finite fields
- Counting problems for orthogonal sets and sublattices in function fields
- An exact result for (0, 1)-vectors
- Multipartite nearly orthogonal sets over finite fields
- On a restricted cross-intersection problem
- Sets with many pairs of orthogonal vectors over finite fields
This page was built for publication: Large sets of nearly orthogonal vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288511)
