Equiangular subspaces in Euclidean spaces
Combinatorics
2018-01-24 v3
Abstract
A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in was studied extensively for the last 70 years. In this paper, we study analogous questions for -dimensional subspaces. We discuss natural ways of defining the angle between -dimensional subspaces and correspondingly study the maximum size of an equiangular set of -dimensional subspaces in . Our bounds extend and improve a result of Blokhuis.
Cite
@article{arxiv.1703.05048,
title = {Equiangular subspaces in Euclidean spaces},
author = {Igor Balla and Benny Sudakov},
journal= {arXiv preprint arXiv:1703.05048},
year = {2018}
}