Related papers: Counting integral matrices with a given characteri…
We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
In this short note we collect together known results on the use of Random Matrix Theory in lattice statistical mechanics. The purpose here is two fold. Firstly the RMT analysis provides an intrinsic characterization of integrability, and…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…
We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.
Motivated by studies of oscillator networks, we study the spectrum of the join of several normal matrices with constant row sums. We apply our results to compute the characteristic polynomial of the join of several regular graphs. We then…
We derive a non-asymptotic expression for the moments of traces of monomials in several independent complex Wishart matrices, extending some explicit formulas available in the literature. We then deduce the explicit expression for the…
We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…
Hooley proved that if $f\in \Bbb Z [X]$ is irreducible of degree $\ge 2$, then the fractions $\{ r/n\}$, $0<r<n$ with $f(r)\equiv 0\pmod n$, are uniformly distributed in $(0,1)$. In this paper we study such problems for reducible…
We establish the asymptotic zero distribution for polynomials generated by a four-term recurrence relation with varying recurrence coefficients having a particular limiting behavior. The proof is based on ratio asymptotics for these…
We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…
Motivated by the recent work on asymptotic independence relations for random matrices with non-commutative entries, we investigate the limit distribution and independence relations for large matrices with identically distributed and Boolean…
This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…
We prove limit theorems for the greatest common divisor and the least common multiple of random integers. While the case of integers uniformly distributed on a hypercube with growing size is classical, we look at the uniform distribution on…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…