Homomorphisms from the Coxeter graph

DOI10.1016/J.LAA.2025.08.003MaRDI QIDQ6925037zbMATH OpenFDO

Authors Marko Orel, Draženka Višnjić

Publication date 26 September 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.08.003

zbMATH Keywords

binary fieldCoxeter graphgraph homomorphismsinvertible matricespreserver problemsranksymmetric matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vector spaces, linear dependence, rank, lineability (15A03) Linear preserver problems (15A86) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Hermitian, skew-Hermitian, and related matrices (15B57) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Review text

Let \(S_n(\mathbb F_2)\) be the set of all \(n\times n\) symmetric matrices over the field of two elements \(\mathbb F_2\) and let \(\mathrm{SGL}_n(\mathbb F_2)\) denote its subset consisting of all invertible matrices. Define \(\hat\Gamma_n\) as the graph whose vertex set is contained in \(S_n(\mathbb F_2)\) and a pair \(\left\{A,B\right\}\) forms an edge if and only if \(\mathrm{rank}(A-B)=1\), and the graph \(\Gamma_n\) will be the graph in \(\hat\Gamma_n\) induces by the set \(\mathrm{SGL}_n(\mathbb F_2)\). This graph is a generalization of the Coxeter graph \(\Gamma_3\). \N\NThe authors study homomorphisms \(\Phi\colon\Gamma_n\to\hat\Gamma_m\). As they can be viewed as the maps \(\Phi\colon \mathrm{SGL}_n(\mathbb F_2)\to S_m(\mathbb F_2)\) satisfying the condition \N\[\N\mathrm{rank}(A-B)=1\quad\Rightarrow\quad \mathrm{rank}(\Phi(A)-\Phi(B))=1,\N\]\Nthis problem may be interpreted as a generalization of fundamental theorem of symmetric matrices over \(\mathbb F_2\). \N\NThe main result states that if \(m\geqslant 3\) and \(\Phi\colon\Gamma_3\to\hat\Gamma_m\) is a graph homomorphism, then there exist \(P\in \mathrm{GL}_m(\mathbb F_2)\), \(B\in S_m(\mathbb F_2)\), and a permutation \(\sigma\) of the set \(\mathcal R_1\) of all rank-one matrices in \(S_3(\mathbb F_2)\) such that either \N\[\N\Phi(A)=P\begin{pmatrix}\Psi_\sigma(A)&0\\\N0&0\\\N\end{pmatrix}P^T+B \quad\textrm{for all } A\in \mathrm{SGL}_3(\mathbb F_2) \N\]\Nor \N\[\N\Phi(A)=P\begin{pmatrix}\Psi_\sigma(A^{-1})&0\\\N0&0\\\N\end{pmatrix}P^T+B \quad\textrm{for all } A\in \mathrm{SGL}_3(\mathbb F_2), \N\]\Nwhere \(\Psi_\sigma\) is the automorphism that is the (unique) extension of a permutation \(\sigma\) of \(\mathcal R_1\).

Cites work

• A classification of self-orthogonal codes over GF(2)
• A complete classification of doubly even self-dual codes of length 40
• A note on adjacency preservers on Hermitian matrices over finite fields
• Adjacency preservers on invertible Hermitian matrices. I.
• Adjacency preservers on invertible Hermitian matrices. II.
• Adjacency preservers, symmetric matrices, and cores
• Adjacency Preserving Maps on Hermitian Matrices
• Adjacency preserving maps on symmetric tensors
• An algorithm for classification of binary self-dual codes
• An enumeration of binary self-dual codes of length 32
• Classification of Binary Self-Dual Codes of Length 40
• Classification of Extremal and s-Extremal Binary Self-Dual Codes of Length 38
• Classification of self-dual codes of length 36
• Coherence invariant maps on order-3 symmetric tensors
• Coherence invariant maps on tensor products
• Graphs associated with matrices over finite fields and their endomorphisms
• Handbook of product graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1284416 (Why is no real title available?)
• scientific article; zbMATH DE number 640827 (Why is no real title available?)
• scientific article; zbMATH DE number 851528 (Why is no real title available?)
• scientific article; zbMATH DE number 883533 (Why is no real title available?)
• scientific article; zbMATH DE number 905159 (Why is no real title available?)
• scientific article; zbMATH DE number 5175633 (Why is no real title available?)
• Hua's fundamental theorem of geometry of rectangular matrices over EAS division rings
• Hua's fundamental theorems of the geometry of matrices and related results
• Linear transformations preserving symmetric rank one matrices
• Maps on matrix and operator algebras
• Maps on matrix spaces
• Nonstandard rank-one nonincreasing maps on symmetric matrices
• On endomorphisms of alternating forms graph
• On generalizations of the Petersen graph and the Coxeter graph
• On the asymptotic number of inequivalent binary self-dual codes
• On the classification and enumeration of self-dual codes
• On the enumeration of self-dual codes
• Parametrization of self-dual codes by orthogonal matrices
• Some extremal self-dual codes and unimodular lattices in dimension 40
• Symmetry in Graphs
• The binary self-dual codes of length up to 32: A revised enumeration
• The distance function on Coxeter-like graphs and self-dual codes
• The graphs of non-degenerate linear codes
• The optimal version of Hua's fundamental theorem of geometry of rectangular matrices
• The optimal version of Hua's fundamental theorem of geometry of square matrices -- the low dimensional case
• Three Remarkable Graphs

Cited in

(1)

• The distance function on Coxeter-like graphs and self-dual codes

This page was built for publication: Homomorphisms from the Coxeter graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925037)