Characteristic polynomials of p-adic matrices

02/06/2017

∙

We analyze the precision of the characteristic polynomial of an n× n p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p^N), we give a criterion (checkable in time O (n^omega)) for χ(A) to have precision exactly O(p^N). We also give a O (n^3) algorithm for determining the optimal precision when the criterion is not satisfied, and give examples when the precision is larger than O(p^N).

READ FULL TEXT

Characteristic polynomials of p-adic matrices

The infinity norm bounds and characteristic polynomial for high order RK matrices

Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time

Computations of the Expected Euler Characteristic for the Largest Eigenvalue of a Real Wishart Matrix

Computation of the Expected Euler Characteristic for the Largest Eigenvalue of a Real Non-central Wishart Matrix

Constructing Faithful Homomorphisms over Fields of Finite Characteristic

On the Evaluation of the Eigendecomposition of the Airy Integral Operator

How Low Can We Go: Trading Memory for Error in Low-Precision Training

Characteristic polynomials of p-adic matrices

Related Research

The infinity norm bounds and characteristic polynomial for high order RK matrices

Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time

Computations of the Expected Euler Characteristic for the Largest Eigenvalue of a Real Wishart Matrix

Computation of the Expected Euler Characteristic for the Largest Eigenvalue of a Real Non-central Wishart Matrix

Constructing Faithful Homomorphisms over Fields of Finite Characteristic

On the Evaluation of the Eigendecomposition of the Airy Integral Operator

How Low Can We Go: Trading Memory for Error in Low-Precision Training