Embedding dimensions of matrices whose entries are indefinite distances in the pseudo-Euclidean space
Authors:
- Hiroshi NozakiHNHiroshi Nozaki
- Masashi ShinoharaMSMasashi Shinohara
- Sho SudaSSSho Suda
Preprint
Abstract
A finite set of the Euclidean space is called an $s$-distance set if the number of Euclidean distances which appear in the finite set is $s$. The major problem for $s$-distance sets is to determine the largest possible $s$-distance sets, and it is solved only for small $s$ and dimensions. In particular, for $s=2$, Lison\v{e}k (1997) gave the classification for any dimensions at most $7$. Lison\v{e}k used a computer assistance and some representation theory of graphs. In this paper, we consider the analogous theory of these results for the pseudo-Euclidean space $\mathbb{R}^{p,q}$. We consider an $s$-indefinite-distance set in the pseudo-Euclidean space, which is used the value \[ || \boldsymbol{x}-\boldsymbol{y} ||=(x_1-y_1)^2 +\cdots +(x_p -y_p)^2-(x_{p+1}-y_{p+1})^2-\cdots -(x_{p+q}-y_{p+q})^2 \] instead of the Euclidean distance. We establish some representation theory of a symmetric matrix as $s$-indefinite-distance sets, which includes or improves the results for Euclidean $s$-distance sets for large $s$. Moreover we classify the largest possible $2$-indefinite-distance set for small dimensions.