Computing with quadratic forms over number fields

  title={Computing with quadratic forms over number fields},
  author={Przemyslaw Koprowski and A. Czogala},
  journal={J. Symb. Comput.},
  • Przemyslaw Koprowski, A. Czogala
  • Published 2018
  • Mathematics, Computer Science
  • J. Symb. Comput.
  • This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number field is either isotropic (respectively locally isotropic) or hyperbolic (respectively locally hyperbolic). Next we give a method of computing the dimension of an anisotropic part of a quadratic forms. The second part of the paper is devoted to algorithms… CONTINUE READING
    3 Citations

    Figures, Tables, and Topics from this paper.

    Hyperbolic manifolds and pseudo-arithmeticity
    • 2
    • PDF
    On Calculating the Slice Genera of 11- and 12-Crossing Knots
    • 7
    • PDF
    CQF Magma package


    A New Computational Approach to Ideal Theory in Number Fields
    • 23
    • PDF
    A course in computational algebraic number theory
    • H. Cohen
    • Mathematics, Computer Science
    • Graduate texts in mathematics
    • 1993
    • 2,546
    Introduction to Quadratic Forms Over Fields
    • 596
    Solving quadratic equations using reduced unimodular quadratic forms
    • D. Simon
    • Computer Science, Mathematics
    • Math. Comput.
    • 2005
    • 48
    • PDF
    Witt equivalence classes of quartic number fields
    • 3
    • PDF
    Polynomial Algorithms in Computer Algebra
    • F. Winkler
    • Mathematics, Computer Science
    • Texts and Monographs in Symbolic Computation
    • 1996
    • 275