Table of Contents
Fetching ...

The largest sets of non-opposite chambers in spherical buildings of type $B$

Jan De Beule, Philipp Heering, Sam Mattheus, Klaus Metsch

TL;DR

This paper addresses the problem of classifying largest families of non-opposite flags (EKR-sets) in finite spherical buildings of type $B$, recasting the center conjecture in an anti-design framework. Using a uniform antidesign-based approach combined with a graph-theoretic opposition framework and ratio bounds, it shows that for $\mathrm{PS}(n,e,q)$ with $e\ge 1$ or $n$ even and large $q$, the maximum EKR-sets of chambers are precisely blow-ups of maximum EKR-sets of points ($s=1$) or generators ($s=n$), with intermediate $s$-spaces not attaining the bound. The authors develop explicit antidesigns and transfer principles that connect chamber configurations to subspace configurations, enabling a complete classification in almost all polar spaces and highlighting exceptional open cases (notably $e=\tfrac{1}{2}$, $n$ odd). The work advances the algebraic approach to EKR problems in spherical buildings and provides a robust method with potential extensions to other types and ranks.

Abstract

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending classical results in vector and polar spaces. This line of research falls under the umbrella of Erdős-Ko-Rado (EKR) problems, but poses some extra difficulty on the algebraic level compared to aforementioned classical results. From the building theory point of view, it can be seen as a variation of the center conjecture for spherical buildings due to Tits, where we replace the convexity assumption by a maximality condition. In previous work, general upper bounds on the size of families of non-opposite flags were obtained by applying eigenvalue and representation-theoretic techniques to the Iwahori-Hecke algebras of non-exceptional buildings. More recently, the classification of families reaching this upper bound in type $A_n$, for $n$ odd, was accomplished by Heering, Lansdown, and Metsch. For buildings of type $B$, the corresponding Iwahori-Hecke algebra is more complicated and depends non-trivially on the type and rank of the underlying polar space. Nevertheless, we are able to find a uniform method based on antidesigns and obtain classification results for chambers (i.e.\ maximal flags) in all cases, except type $^2A_{4n-3}$.

The largest sets of non-opposite chambers in spherical buildings of type $B$

TL;DR

This paper addresses the problem of classifying largest families of non-opposite flags (EKR-sets) in finite spherical buildings of type , recasting the center conjecture in an anti-design framework. Using a uniform antidesign-based approach combined with a graph-theoretic opposition framework and ratio bounds, it shows that for with or even and large , the maximum EKR-sets of chambers are precisely blow-ups of maximum EKR-sets of points () or generators (), with intermediate -spaces not attaining the bound. The authors develop explicit antidesigns and transfer principles that connect chamber configurations to subspace configurations, enabling a complete classification in almost all polar spaces and highlighting exceptional open cases (notably , odd). The work advances the algebraic approach to EKR problems in spherical buildings and provides a robust method with potential extensions to other types and ranks.

Abstract

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending classical results in vector and polar spaces. This line of research falls under the umbrella of Erdős-Ko-Rado (EKR) problems, but poses some extra difficulty on the algebraic level compared to aforementioned classical results. From the building theory point of view, it can be seen as a variation of the center conjecture for spherical buildings due to Tits, where we replace the convexity assumption by a maximality condition. In previous work, general upper bounds on the size of families of non-opposite flags were obtained by applying eigenvalue and representation-theoretic techniques to the Iwahori-Hecke algebras of non-exceptional buildings. More recently, the classification of families reaching this upper bound in type , for odd, was accomplished by Heering, Lansdown, and Metsch. For buildings of type , the corresponding Iwahori-Hecke algebra is more complicated and depends non-trivially on the type and rank of the underlying polar space. Nevertheless, we are able to find a uniform method based on antidesigns and obtain classification results for chambers (i.e.\ maximal flags) in all cases, except type .

Paper Structure

This paper contains 7 sections, 39 theorems, 38 equations.

Key Result

Theorem 1.4

Consider $\mathrm{PS}(n,e,q)$ for $n \geqslant 3$ except the case $e = 1/2$ and $n$ odd. Then for sufficiently large $q$ (in terms of $n$) a maximum EKR-set of chambers has the structure described in E: blow-ups of s-spaces for $s\in \{1,n\}$.

Theorems & Definitions (77)

  • Definition 1.1
  • Example 1.2
  • Theorem 1.4
  • Theorem 1.5
  • Corollary 1.6
  • Theorem 1.7
  • Lemma 2.1
  • Lemma 2.2: see Lemma 9.4.1 in distance-regular-graphs and Remark 4.1.2 in Vanhove_PhD
  • Lemma 2.3
  • proof
  • ...and 67 more