On Kruskal's theorem that every 3 x 3 x 3 array has rank at most 5
Abstract
In the first part of this paper, we consider 3 x 3 x 3 arrays with complex entries, and provide a complete self-contained proof of Kruskal's theorem that the maximum rank is 5. In the second part, we provide a complete classification of the canonical forms of 3 x 3 x 3 arrays over F2; in particular, we obtain explicit examples of such arrays with rank 6.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.