On bilinear algorithms for multiplication in quaternion algebras

Vladimir Lysikov

On bilinear algorithms for multiplication in quaternion algebras

Vladimir Lysikov

Publikation: Konferencebidrag › Konferenceabstrakt til konference › Forskning

Abstract

We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank studied by Blaeser and de Voltaire.

Originalsprog	Engelsk
Publikationsdato	2012
Status	Udgivet - 2012
Udgivet eksternt	Ja

Adgang til dokumentet

https://arxiv.org/abs/1206.5501

Citationsformater

@conference{56cb07b8131743079a8c4924217e5143,

title = "On bilinear algorithms for multiplication in quaternion algebras",

abstract = "We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank studied by Blaeser and de Voltaire.",

author = "Vladimir Lysikov",

year = "2012",

language = "English",

}

TY - ABST

T1 - On bilinear algorithms for multiplication in quaternion algebras

AU - Lysikov, Vladimir

PY - 2012

Y1 - 2012

N2 - We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank studied by Blaeser and de Voltaire.

AB - We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank studied by Blaeser and de Voltaire.

M3 - Conference abstract for conference

ER -