2011/02/15 by Cristina Flaut, Flaut, Cristina
Computer Science · Mathematics · #Algebraic and Geometric Analysis #FOS: Mathematics #Polynomial and algebraic computation #Rings and Algebras (math.RA)
paper · pdf · doi:10.48550/arxiv.1102.3026
openalex publication_date 2011/02/15 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
In this paper we will prove that any number n∈ N-0 could be realised as level of an algebra obtained by the Cayley-Dickson process over a suitable field.