Splitting quaternion algebras over quadratic number fields

06/03/2016
by   Péter Kutas, et al.
0

We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over Q(√(d)) where d is a square-free integer. The algorithm is deterministic and runs in polynomial time if one is allowed to call oracles for factoring integers and polynomials over finite fields.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2016

Explicit equivalence of quadratic forms over F_q(t)

We propose a randomized polynomial time algorithm for computing nontrivi...
research
01/18/2019

Optimal Space-Time Block Code Designs Based on Irreducible Polynomials of Degree Two

The main of this paper is to prove that in terms of normalized density, ...
research
01/01/2022

The solutions to single-variable polynomials, implemented and verified in Lean

In this work, we describe our experience in learning the use of a comput...
research
05/19/2016

Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems

Bézout 's theorem states that dense generic systems of n multivariate qu...
research
09/30/2022

Formalized Class Group Computations and Integral Points on Mordell Elliptic Curves

Diophantine equations are a popular and active area of research in numbe...
research
05/12/2018

An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm

An indexing of a finite set S is a bijection D : {1,...,|S|}→ S. We pres...

Please sign up or login with your details

Forgot password? Click here to reset