Saltar al contenido principal

Escribe una PREreview

Unveiling the Structure of Cayley-Dickson Algebras: Zero Divisor Counting and Listing, and a Novel Sign Compression Scheme

Publicada
Servidor
Zenodo
DOI
10.5281/zenodo.22051873

This paper presents a comprehensive computational and empirical investigation into the structure and properties of Cayley-Dickson algebras (AxA_x, dimension 2x2^x). We establish and validate an explicit formula, N(x)=(2x2)(2x4)(2x8)16N(x) = \frac{(2^x - 2)(2^x - 4)(2^x - 8)}{16}, which accurately enumerates a specific class of unique zero divisor pairs for x4x \geq 4.

Complementing this quantitative result, a detailed structural analysis of the multiplication tables reveals a recursive decomposition into 8×88\times8 blocks, reflecting octonion substructures. We introduce a novel ``block type'' classification (`x' or `y') based on an indicator element (e(8k,8k+1)e_{(8k, 8k+1)}), which determines zero divisor location and highlights recursive patterns. Conceptual frameworks like an ``Observed Pattern Multiplication Table'' and a sign compression scheme guided this work. A Python script is provided. While OPMT is formally proven and computationally validated, the other many findings are empirical conjectures requiring formal mathematical development, yet they offer a substantially deeper understanding of Cayley-Dickson algebras.

Puedes escribir una PREreview de Unveiling the Structure of Cayley-Dickson Algebras: Zero Divisor Counting and Listing, and a Novel Sign Compression Scheme. Una PREreview es una revisión de un preprint y puede variar desde unas pocas oraciones hasta un extenso informe, similar a un informe de revisión por pares organizado por una revista.

Antes de comenzar

We will ask you to log in with your ORCID iD. If you don’t have an iD, you can create one.

What is an ORCID iD?

An ORCID iD is a unique identifier that distinguishes you from everyone with the same or similar name.

Comenzar ahora