An algebraic approach to Erdos-Ko-Rado sets of flags in spherical buildings II

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…