English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We investigate $\{0, 1, \ldots, t \}$-cliques of generators on dual polargraphs of finite classical polar spaces of rank $d$. These cliques are alsoknown as Erd\H{o}s-Ko-Rado sets in polar spaces of generators with pairwiseintersections in at most codimension $t$. Our main result is that we classifyall such cliques of maximum size for $t \leq \sqrt{8d/5}-2$ if $q \geq 3$, and$t \leq \sqrt{8d/9}-2$ if $q = 2$. We have the following byproducts. (a) For $q\geq 3$ we provide estimates of Hoffman's bound on these $\{0, 1, \ldots, t\}$-cliques for all $t$. (b) For $q \geq 3$ we determine the largest, secondlargest, and smallest eigenvalue of the graphs which have the generators of apolar space as vertices and where two generators are adjacent if and only ifthey meet in codimension at least $t+1$. Furthermore, we provide nice explicitformulas for all eigenvalues of these graphs. (c) We provide upper bounds onthe size of the second largest maximal $\{0, 1, \ldots, t \}$-cliques for some$t$.

Large $\{0, 1, \ldots, t\}$-Cliques in Dual Polar Graphs