Search arXivSearch

arXiv · 1405.6888

Cayley-Dickson Algebras and Finite Geometry

Abstract

Given a $2^N$-dimensional Cayley-Dickson algebra, where $3 \leq N \leq 6$, we first observe that the multiplication table of its imaginary units $e_a$, $1 \leq a \leq 2^N -1$, is encoded in the properties of the projective space PG$(N-1,2)$ if one regards these imaginary units as points and distinguished triads of them $\{e_a, e_b, e_c\}$, $1 \leq a < b <c \leq 2^N -1$ and $e_ae_b = \pm e_c$, as lines. This projective space is seen to feature two distinct kinds of lines according as $a+b = c$ or $a+b \neq c$. Consequently, it also exhibits (at least two) different types of points in dependence on how many lines of either kind pass through each of them. In order to account for such partition of the PG$(N-1,2)$, the concept of Veldkamp space of a finite point-line incidence structure is employed. The corresponding point-line incidence structure is found to be a binomial $\left({N+1 \choose 2}_{N-1}, {N+1 \choose 3}_{3}\right)$-configuration ${\cal C}_N$; in particular, ${\cal C}_3$ (octonions) is isomorphic to the Pasch $(6_2,4_3)$-configuration, ${\cal C}_4$ (sedenions) is the famous Desargues $(10_3)$-configuration, ${\cal C}_5$ (32-nions) coincides with the Cayley-Salmon $(15_4,20_3)$-configuration found in the well-known Pascal mystic hexagram and ${\cal C}_6$ (64-nions) is identical with a particular $(21_5,35_3)$-configuration that can be viewed as four triangles in perspective from a line where the points of perspectivity of six pairs of them form a Pasch configuration. We also draw attention to a remarkable nesting pattern formed by these configurations, where ${\cal C}_{N-1}$ occurs as a geometric hyperplane of ${\cal C}_N$. Finally, a brief examination of the structure of generic ${\cal C}_N$ leads to a conjecture that ${\cal C}_N$ is isomorphic to a combinatorial Grassmannian of type $G_2(N+1)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Metod Saniga, Frederic Holweck, Petr Pracna. 2014-06-02. Cayley-Dickson Algebras and Finite Geometry. https://doi.org/10.3390/math3041192

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