Upper Bounds for s-Distance Subspaces
Abstract
As a generalization of equiangular lines, equiangular subspaces were first systematically studied by Balla, Dr\"axler, Keevash and Sudakov in 2017. In this paper, we extend their work to s-distance subspaces, i.e., to sets of k-dimensional subspaces in Rn whose pairwise distances take s distinct values. We establish upper bounds on the maximum cardinality of such sets. In particular, our bounds generalize and improve results of Balla and Sudakov.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.