相关论文: Autocorrelation of Random Matrix Polynomials

We develop the theory of $L^2$-torsion of an automorphism of a group and compute it for every automorphism of a group which is hyperbolic and one-ended relative to a finite collection of virtually polycyclic groups. We also prove a…

Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…

We introduce the concept of reflexive moment functional in two variables and the definition of reflexive orthogonal polynomial system. Also reverse matrices and their interesting algebraic properties are studied. Reverse matrices and…

We consider the asymptotic behaviour of the second-order correlation function of the characteristic polynomial of a real symmetric random matrix. Our main result is that the existing result for a random matrix from the Gaussian Orthogonal…

For the orthogonal-unitary and symplectic-unitary transitions in random matrix theory, the general parameter dependent distribution between two sets of eigenvalues with two different parameter values can be expressed as a quaternion…

The microscopic correlation functions of non-chiral random matrix models with complex eigenvalues are analyzed for a wide class of non-Gaussian measures. In the large-N limit of weak non-Hermiticity, where N is the size of the complex…

We study the behavior of two-time correlation functions at late times for finite system sizes considering observables whose (one-point) average value does not depend on energy. In the long time limit, we show that such correlation functions…

We review a recent construction of an explicit analytic series representation for symmetric polynomials which up to a groundstate factor are eigenfunctions of Calogero-Sutherland type models. We also indicate a generalisation of this result…

In this paper, we investigate PN-sequences with ideal autocorrelation property and the consequences of this property on the number of +1s and -1s and run structure of sequences. We begin by discussing and surveying about the length of…

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.…

Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…

We compute the graded automorphisms of the upper triangular matrices, viewed as associative, Lie and Jordan algebras. We compute also the so called self-equivalences and Weyl and diagonal groups for every grading.

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…

We present a concentration inequality for linear functionals of noncommutative polynomials in random matrices. Our hypotheses cover most standard ensembles, including Gaussian matrices, matrices with independent uniformly bounded entries…

We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…

We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on…

We show that various identities from [1] and [3] involving Gould-Hopper polynomials can be deduced from the real but also complex orthogonal invariance of multivariate Gaussian distributions. We also deduce from this principle a useful…