arXiv Analytics

Sign in

arXiv:2408.05015 [math.CO]AbstractReferencesReviewsResources

An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings II

Jan De Beule, Sam Mattheus, Klaus Metsch

Published 2024-08-09Version 1

We continue our investigation of Erd\H{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\H{o}s-Ko-Rado sets of flags may potentially be found. This was recently shown to be possible for type $A_n$, $n$ odd, by Heering, Lansdown, and the last author by making use of the current work.

Related articles: Most relevant | Search more
arXiv:2007.01104 [math.CO] (Published 2020-07-02)
An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
arXiv:1110.6207 [math.CO] (Published 2011-10-27, updated 2016-03-05)
Profiles of separations in graphs and matroids
arXiv:2110.09970 [math.CO] (Published 2021-10-19, updated 2023-05-24)
Graphs with all holes the same length
Linda Cook et al.