On orthogonality graphs of Okubo algebras
Abstract
The orthogonality graph of an Okubo algebra with isotropic norm over an arbitrary field F is considered. Its connected components are described, and their diameters are computed. It is shown that there exist at most two shortest paths between any pair of vertices, and the conditions under which the shortest path is unique are determined.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.