Related papers: Characteristic polynomials of p-adic matrices

In recent years, several powerful techniques have been developed to design {\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Let $A$ be an $n\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\exp(-\Omega(\epsilon n))$ in the choice of $A$,…

Let $\chi(A)$ denote the characteristic polynomial of a matrix $A$ over a field; a standard result of linear algebra states that $\chi(A^{-1})$ is the reciprocal polynomial of $\chi(A)$. More formally, the condition $\chi^n(X)…

In this paper, using techniques developed in our earlier works on the theory of mod-Gaussian convergence, we prove precise moderate and large deviation results for the logarithm of the characteristic polynomial of a random unitary matrix.…

In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

We give some classes of power maps with low $c$-differential uniformity over finite fields of odd characteristic, {for $c=-1$}. Moreover, we give a necessary and sufficient condition for a linearized polynomial to be a perfect $c$-nonlinear…

We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when the column sums are bounded. Binary or non-negative integer…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

We formulate a $p$-adic optimisation problem on matrix factorisation, and investigate a heuristic method for it analogous to PCA.

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

In this paper, we study the characters of homogeneous monotonic P-polynomial table algebras with finite dimension d>=5. We then apply them to association schemes. To this end, we develop some methods using tridiagonal matrices and…

La Budde's method computes the characteristic polynomial of a real matrix A in two stages: first it applies orthogonal similarity transformations to reduce A to upper Hessenberg form H, and second it computes the characteristic polynomial…

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…