Upper Bounds for s-Distance Subspaces

2025/11/12 by Wang, LiXia, Ye, Ke
#Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.2511.09076

Abstract

As a generalization of equiangular lines, equiangular subspaces were first systematically studied by Balla, Dräxler, 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 ℝⁿ 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.

Related

• Equiangular subspaces in Euclidean spaces
• Upper bounds for s-distance sets and equiangular lines
• About subspaces the most deviating from the coordinate ones
• New upper bound for the cardinalities of s-distance sets on the unit sphere
• Constructions of maximum few-distance sets in Euclidean spaces