Search arXivSearch

arXiv · 2006.15581

Generalized Grassmann graphs associated to conjugacy classes of finite-rank self-adjoint operators

Abstract

Two distinct projections of finite rank $m$ are adjacent if their difference is an operator of rank two or, equivalently, the intersection of their images is $(m-1)$-dimensional. We extend this adjacency relation on other conjugacy classes of finite-rank self-adjoint operators which leads to a natural generalization of Grassmann graphs. Let ${\mathcal C}$ be a conjugacy class formed by finite-rank self-adjoint operators with eigenspaces of dimension greater than $1$. Under the assumption that operators from ${\mathcal C}$ have at least three eigenvalues we prove that every automorphism of the corresponding generalized Grassmann graph is the composition of an automorphism induced by a unitary or anti-unitary operator and the automorphism obtained from a permutation of eigenspaces with the same dimensions. The case when the operators from ${\mathcal C}$ have two eigenvalues only is covered by classical Chow's theorem which says that there are graph automorphisms induced by semilinear automorphisms not preserving orthogonality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark Pankov, Krzysztof Petelczyc, Mariusz Zynel. 2020-06-28. Generalized Grassmann graphs associated to conjugacy classes of finite-rank self-adjoint operators. https://arxiv.org/abs/2006.15581

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO