Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.00740 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913374117298176 |
|---|---|
| author | Heering, Philipp Lansdown, Jesse Metsch, Klaus |
| author_facet | Heering, Philipp Lansdown, Jesse Metsch, Klaus |
| contents | A chamber of the vector space $\mathbb{F}_q^n$ is a set $\{S_1,\dots,S_{n-1}\}$ of subspaces of $\mathbb{F}_q^n$ where $S_1\subset S_2\subset \dotso \subset S_{n-1}$ and $\dim(S_i)=i$ for $i=1,\dots,n-1$. By $Γ_n(q)$ we denote the graph whose vertices are the chambers of $\mathbb{F}_q^n$ with two chambers $C_1=\{S_1,\dots,S_{n-1}\}$ and $C_2=\{T_1,\dots,T_{n-1}\}$ adjacent in $Γ_n(q)$, if $S_i\cap T_{n-i}=\{0\}$ for $i=1,\dots,n-1$. The Erdős-Ko-Rado problem on chambers is equivalent to determining the structure of independent sets of $Γ_n(q)$. The independence number of this graph was determined in [7] for $n$ even and given a subspace $P$ of dimension one, the set of all chambers whose subspaces of dimension $\frac n2$ contain $P$ attains the bound. The dual example of course also attains the bound. It remained open in [7] whether or not these are all maximum independent sets. Using a description from [6] of the eigenspace for the smallest eigenvalue of this graph, we prove an Erdős-Ko-Rado theorem on chambers of $\mathbb{F}_q^n$ for sufficiently large $q$, giving an affirmative answer for n even. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_00740 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Maximum Erdős-Ko-Rado sets of chambers and their antidesigns in vector-spaces of even dimension Heering, Philipp Lansdown, Jesse Metsch, Klaus Combinatorics A chamber of the vector space $\mathbb{F}_q^n$ is a set $\{S_1,\dots,S_{n-1}\}$ of subspaces of $\mathbb{F}_q^n$ where $S_1\subset S_2\subset \dotso \subset S_{n-1}$ and $\dim(S_i)=i$ for $i=1,\dots,n-1$. By $Γ_n(q)$ we denote the graph whose vertices are the chambers of $\mathbb{F}_q^n$ with two chambers $C_1=\{S_1,\dots,S_{n-1}\}$ and $C_2=\{T_1,\dots,T_{n-1}\}$ adjacent in $Γ_n(q)$, if $S_i\cap T_{n-i}=\{0\}$ for $i=1,\dots,n-1$. The Erdős-Ko-Rado problem on chambers is equivalent to determining the structure of independent sets of $Γ_n(q)$. The independence number of this graph was determined in [7] for $n$ even and given a subspace $P$ of dimension one, the set of all chambers whose subspaces of dimension $\frac n2$ contain $P$ attains the bound. The dual example of course also attains the bound. It remained open in [7] whether or not these are all maximum independent sets. Using a description from [6] of the eigenspace for the smallest eigenvalue of this graph, we prove an Erdős-Ko-Rado theorem on chambers of $\mathbb{F}_q^n$ for sufficiently large $q$, giving an affirmative answer for n even. |
| title | Maximum Erdős-Ko-Rado sets of chambers and their antidesigns in vector-spaces of even dimension |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.00740 |