Explicit equivalence of quadratic forms over F_q(t)

From MaRDI portal
Publication:1633281



Abstract: We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over mathbbFq(t), where mathbbFq is a finite field of odd characteristic. The algorithm is based on a suitable splitting of the form into two forms and finding a common value they both represent. We make use of an effective formula for the number of fixed degree irreducible polynomials in a given residue class. We apply our algorithms for computing a Witt decomposition of a quadratic form, for computing an explicit isometry between quadratic forms and finding zero divisors in quaternion algebras over quadratic extensions of mathbbFq(t).












This page was built for publication: Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633281)