English

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 Rn\mathbb{R}^n was studied extensively for the last 70 years. In this paper, we study analogous questions for kk-dimensional subspaces. We discuss natural ways of defining the angle between kk-dimensional subspaces and correspondingly study the maximum size of an equiangular set of kk-dimensional subspaces in Rn\mathbb{R}^n. Our bounds extend and improve a result of Blokhuis.

Keywords

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}
}
R2 v1 2026-06-22T18:46:04.045Z