Related papers: On the Grassmann Graph of Linear Codes

We discuss the Grassmann graph $J_q(N,D)$ with $N \geq 2D$, having as vertices the $D$-dimensional subspaces of an $N$-dimensional vector space over the finite field $\mathbb{F}_q$. This graph is distance-regular with diameter $D$; to avoid…

In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the $2$-clique extension of the $(t+1)\times(t+1)$-grid is determined by its spectrum when $t$ is large…

Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest…

We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…

Let (M,g) be a compact Riemannian manifold of dimension n. For k \in {0,...,n}, we denote Gr_{k}(M) the set of compact, connected and oriented submanifolds of M of dimension k. This set is called the non-linear Grassmannian. In this…

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

In this paper, we study the Grassmannian of n-dimensional subspaces of a 2n-dimensional vector space and its infinite-dimensional analogues. Such a Grassmannian can be endowed with two binary relations (adjacent and distant), with pencils…

The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…

The Grassmannian ${\mathcal G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n$. It is well known that codes in the Grassmannian space can be used for error-correction in random network coding. On the…

Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…

Denote by $\mathbb G(k,n)$ the Grassmannian of linear subspaces of dimension $k$ in $\mathbb P^n$. We show that if $n>m$ then every morphism $\varphi: \mathbb G(k,n) \to \mathbb G(l,m)$ is constant.

Let $\Pi$ be a polar space of type $\textsf{D}_{n}$. Denote by ${\mathcal G}_{\delta}(\Pi)$, $\delta\in \{+,-\}$ the associated half-spin Grassmannians and write $\Gamma_{\delta}(\Pi)$ for the corresponding half-spin Grassmann graphs. In…

Let $V$ be an $n$-dimensional left vector space over a division ring $R$ and $n\ge 3$. Denote by ${\mathcal G}_{k}$ the Grassmann space of $k$-dimensional subspaces of $V$ and put ${\mathfrak G}_{k}$ for the set of all pairs $(S,U)\in…

Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes…

Let $S_d(n)$ denote the minimum number of wires of a depth-$d$ (unbounded fan-in) circuit encoding an error-correcting code $C:\{0, 1\}^n \to \{0, 1\}^{32n}$ with distance at least $4n$. G\'{a}l, Hansen, Kouck\'{y}, Pudl\'{a}k, and Viola…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph of diameter $d\geq 3$. Fix a vertex $\gamma$ of $\Gamma$ and consider the subgraph induced on the union of the last two subconstituents of $\Gamma$ with respect to $\gamma$. We prove…

An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study…