grassmann graph
Recently Published Documents


TOTAL DOCUMENTS

12
(FIVE YEARS 5)

H-INDEX

2
(FIVE YEARS 0)

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Ying Ying Tan ◽  
Xiaoye Liang ◽  
Jack Koolen

In the survey paper by Van Dam, Koolen and Tanaka (2016), they asked to classify the thin $Q$-polynomial distance-regular graphs. In this paper, we show that a thin distance-regular graph with the same intersection numbers as a Grassmann graph $J_q(n, D)~ (n \geqslant 2D)$ is the Grassmann graph if $D$ is large enough.


2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Mark Pankov ◽  
Krzysztof Petelczyc ◽  
Mariusz Źynel

Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they are compatible and adjacent (the corresponding rank-$k$ projections commute and their difference is an operator of rank $2$). Our main result is the following: if $\dim H\ne 2k$, then every automorphism of $\Gamma^{\perp}_{k}(H)$ is induced by a unitary or anti-unitary operator; if $\dim H=2k\ge 6$, then every automorphism of $\Gamma^{\perp}_{k}(H)$ is induced by a unitary or anti-unitary operator or it is the composition of such an automorphism and the orthocomplementary map. For the case when $\dim H=2k=4$ the statement fails. To prove this statement we compare geodesics of length two in ortho-Grassmann graphs and characterise compatibility (commutativity) in terms of geodesics in Grassmann and ortho-Grassmann graphs. At the end, we extend this result on generalised ortho-Grassmann graphs associated to conjugacy classes of finite-rank self-adjoint operators.


2021 ◽  
Vol 75 ◽  
pp. 101895
Author(s):  
Ilaria Cardinali ◽  
Luca Giuzzi ◽  
Mariusz Kwiatkowski
Keyword(s):  

10.37236/9873 ◽  
2020 ◽  
Vol 27 (4) ◽  
Author(s):  
Hajime Tanaka ◽  
Tao Wang

The Terwilliger algebra $T(x)$ of a finite connected simple graph $\Gamma$ with respect to a vertex $x$ is the complex semisimple matrix algebra generated by the adjacency matrix $A$ of $\Gamma$ and the diagonal matrices $E_i^*(x)=\operatorname{diag}(v_i)$ $(i=0,1,2,\dots)$, where $v_i$ denotes the characteristic vector of the set of vertices at distance $i$ from $x$. The twisted Grassmann graph $\tilde{J}_q(2D+1,D)$ discovered by Van Dam and Koolen in 2005 has two orbits of the automorphism group on its vertex set, and it is known that one of the orbits has the property that $T(x)$ is thin whenever $x$ is chosen from it, i.e., every irreducible $T(x)$-module $W$ satisfies $\dim E_i^*(x)W\leqslant 1$ for all $i$. In this paper, we determine all the irreducible $T(x)$-modules of $\tilde{J}_q(2D+1,D)$ for this "thin" case.


10.37236/8672 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Stefaan De Winter ◽  
Klaus Metsch

We construct an infinite family of intriguing sets, or equivalently perfect 2-colorings, that are not tight in the Grassmann graph of planes of PG$(n,q)$, $n\ge 5$ odd, and show that the members of the family are the smallest possible examples if $n\ge 9$ or $q\ge 25$.


10.37236/6428 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Qianqian Yang ◽  
Aida Abiad ◽  
Jack H. Koolen

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 enough. This result will help to show that the Grassmann graph $J_2(2D,D)$ is determined by its intersection numbers as a distance regular graph, if $D$ is large enough.


Author(s):  
Tee Connie ◽  
Michael Kah Ong Goh ◽  
Andrew Beng Jin Teoh

Sign in / Sign up

Export Citation Format

Share Document