相关论文: Counting integral matrices with a given characteri…

We consider a class of random banded Hessenberg matrices with independent entries having identical distributions along diagonals. The distributions may be different for entries belonging to different diagonals. For a sequence of $n\times n$…

We present an explicit polynomial formula for evaluating the principal logarithm of all matrices lying on the line segment $\{I(1-t)+At:t\in [0,1]\}$ joining the identity matrix $I$ (at $t=0$) to any real matrix $A$ (at $t=1$) having no…

We give asymptotic formulae for random matrix averages of derivatives of characteristic polynomials over the groups USp(2N), SO(2N) and O^-(2N). These averages are used to predict the asymptotic formulae for moments of derivatives of…

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…

In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…

For a fixed integer $e \geqslant 3$ and $n$ large enough, we show that the number of congruence classes modulo $2^e$ of characteristic polynomials of $n \times n$ symmetric $\{\pm 1\}$-matrices with constant diagonal is equal to…

Exact integral expressions of the skew orthogonal polynomials involved in Orthogonal (beta=1) and Symplectic (beta=4) random matrix ensembles are obtained: the (even rank) skew orthogonal polynomials are average characteristic polynomials…

We have obtained the exact asymptotics of the determinant $\det_{1\leq r,s\leq L}[\binom{r+s-2}{r-1}+\exp(i\theta)\delta_{r,s}]$. Inverse symbolic computing methods were used to obtain exact analytical expressions for all terms up to…

Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.

We study the moments of the absolute characteristic polynomial of the real elliptic ensemble, including the case of the real Ginibre ensemble. We obtain asymptotics for all integral moments inside the real bulk to order 1 + o(1). In…

We prove effective equidistribution theorems, with polynomial error rate, for orbits of the unipotent subgroups of $\operatorname{SL}_2(\mathbb R)$ in arithmetic quotients of $\operatorname{SL}_2(\mathbb C)$ and $\operatorname{SL}_2(\mathbb…

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Given a sequence of complex numbers {\rho}_n, we study the asymptotic distribution of the sets of parameters c {\epsilon} C such that the quadratic maps z^2 +c has a cycle of period n and multiplier {\rho}_n. Assume 1/n.log|{\rho}_n| tends…

Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…

We solve an asymptotic problem in the geometry of numbers, where we count the number of singular $n\times n$ matrices where row vectors are primitive and of length at most T. Without the constraint of primitivity, the problem was solved by…

Monte Carlo integration is a commonly used technique to compute intractable integrals and is typically thought to perform poorly for very high-dimensional integrals. To show that this is not always the case, we examine Monte Carlo…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…