We continue our investigation of Erd{o}s-Ko-Rado (EKR) sets of flags in spherical buildings. In previous work, we used the theory of buildings and Iwahori-Hecke algebras to obtain upper bounds on their size. As the next step towards the classification of the maximal EKR-sets, we describe the eigenspaces for the smallest eigenvalue of the opposition graphs. We determine their multiplicity and provide a combinatorial description of spanning sets of these subspaces, from which a complete description of the maximal Erd{o}s-Ko-Rado sets of flags may potentially be found. This was recently shown to be possible for type Aₙ, n odd, by Heering, Lansdown, and the last author by making use of the current work.
No takes yet. Share an insight, caveat, or question.
Beule et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: