Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tops of graphs of non-degenerate linear codes (2312.14523v4)

Published 22 Dec 2023 in math.CO

Abstract: Let $\Gamma_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 $\Gamma(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 $\Gamma(n,k)q$, which are intersections of tops of $\Gamma_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 $\Gamma(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 $\Gamma(n,k+1)_{q}$.

Citations (2)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com