pith. sign in

arxiv: 1010.2606 · v1 · pith:ZM4NPHDJnew · submitted 2010-10-13 · 🧮 math.CO

The A-like matrices for a hypercube

classification 🧮 math.CO
keywords denotepartantisymmetrichypercubelikematrixsymmetrica-like
0
0 comments X
read the original abstract

Let $D$ denote a positive integer and let $Q_D$ denote the graph of the $D$-dimensional hypercube. Let $X$ denote the vertex set of $Q_D$ and let $A \in \MX$ denote the adjacency matrix of $Q_D$. A matrix $B \in \MX$ is called $A$-{\em like} whenever both (i) $BA = AB$; (ii) for all $x,y \in X$ that are not equal or adjacent, the $(x,y)$-entry of $B$ is zero. Let $\Al$ denote the subspace of $\MX$ consisting of the $A$-like elements. We decompose $\Al$ into the direct sum of its symmetric part and antisymmetric part. We give a basis for each part. The dimensions of the symmetric part and antisymmetric part are $D+1$ and ${D \choose 2}$, respectively.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.