Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2312.14523 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910925181681664 |
|---|---|
| author | Bartnicka, Edyta Matraś, Andrzej |
| author_facet | Bartnicka, Edyta Matraś, Andrzej |
| contents | Let $Γ_k(V)$ be the Grassmann graph whose vertex set ${\mathcal G}_{k}(V)$ is formed by all $k$-dimensional subspaces of an $n$-dimensional vector space $V$ over the finite field $F_q$ consisting of $q$ elements. We discuss its subgraph $Γ(n,k)_q$ with the vertex set ${\mathcal C}(n,k)_q$ consisting of all non-degenerate linear $[n, k]_q$ codes. %We assume that $1<k<n-1$. We study maximal cliques $\langle U]^{c}_{k}$ of $Γ(n,k)_q$, which are intersections of tops of $Γ_k(V)$ with ${\mathcal C}(n,k)_q$. We show when they are contained in a line of ${\mathcal G}_{k}(V)$ and then we prove that $\langle U]^{c}_{k}$ is a maximal clique of $Γ(n,k)_q$ when it is not contained in a line of ${\mathcal G}_{k}(V)$. Furthermore, we show that the automorphism group of the set of such maximal cliques is isomorphic with the automorphism group of $Γ(n,k+1)_{q}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_14523 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Tops of graphs of non-degenerate linear codes Bartnicka, Edyta Matraś, Andrzej Combinatorics Let $Γ_k(V)$ be the Grassmann graph whose vertex set ${\mathcal G}_{k}(V)$ is formed by all $k$-dimensional subspaces of an $n$-dimensional vector space $V$ over the finite field $F_q$ consisting of $q$ elements. We discuss its subgraph $Γ(n,k)_q$ with the vertex set ${\mathcal C}(n,k)_q$ consisting of all non-degenerate linear $[n, k]_q$ codes. %We assume that $1<k<n-1$. We study maximal cliques $\langle U]^{c}_{k}$ of $Γ(n,k)_q$, which are intersections of tops of $Γ_k(V)$ with ${\mathcal C}(n,k)_q$. We show when they are contained in a line of ${\mathcal G}_{k}(V)$ and then we prove that $\langle U]^{c}_{k}$ is a maximal clique of $Γ(n,k)_q$ when it is not contained in a line of ${\mathcal G}_{k}(V)$. Furthermore, we show that the automorphism group of the set of such maximal cliques is isomorphic with the automorphism group of $Γ(n,k+1)_{q}$. |
| title | Tops of graphs of non-degenerate linear codes |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2312.14523 |