Upper Bounds for $s$-Distance Subspaces
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908647781564416 |
|---|---|
| author | Wang, LiXia Ye, Ke |
| author_facet | Wang, LiXia Ye, Ke |
| contents | 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 $\mathbb{R}^n$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_09076 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Upper Bounds for $s$-Distance Subspaces Wang, LiXia Ye, Ke Metric Geometry Combinatorics 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 $\mathbb{R}^n$ 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. |
| title | Upper Bounds for $s$-Distance Subspaces |
| topic | Metric Geometry Combinatorics |
| url | https://arxiv.org/abs/2511.09076 |