2020/07/14 by Csahók, Tímea, Kutas, Péter, Montessinos, Mickaël +1
#FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Rings and Algebras (math.RA) #Symbolic Computation (cs.SC)
paper · doi:10.48550/arxiv.2007.06981
Let L be a separable quadratic extension of either ℚ or \mathbbFq(t). We propose efficient algorithms for finding isomorphisms between quaternion algebras over L. Our techniques are based on computing maximal one-sided ideals of the corestriction of a central simple L-algebra.