Related papers: On Properties of Polynomials in Random Elements

Since the seminal work of Keating and Snaith, the characteristic polynomial of a random Haar-distributed unitary matrix has seen several of its functional studied or turned into a conjecture; for instance: $ \bullet $ its value in $1$…

This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these…

We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…

The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They…

This article addresses an equidistribution problem concerning the zeros of systems of random holomorphic sections of positive line bundles on compact K\"{a}hler manifolds and random polynomials on $\mathbb{C}^{m}$ in the setting of the…

We consider nonparametric regression with functional covariates, that is, they are elements of an infinite-dimensional Hilbert space. A locally polynomial estimator is constructed, where an orthonormal basis and various tuning parameters…

We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

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…

We study divisibility properties of a set $\{f_1(\mathbf{U}_n^{(s)}),\ldots,f_m(\mathbf{U}_n^{(s)})\}$, where $f_1,\ldots,f_m$ are polynomials in $s$ variables over $\mathbb{Z}$ and $\mathbf{U}_n^{(s)}$ is a point picked uniformly at random…

Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.

We prove that certain classical groups $G\subseteq {\rm GL}(d,\mathbb{R}^d)$ serve to characterize ordinary polynomials in $d$ real variables as elements of finite-dimensional subspaces of $C(\mathbb{R}^d)$ that are invariant by changes of…

We study the volume distribution of nodal domains of random band-limited functions on generic manifolds, and find that in the high energy limit a typical instance obeys a deterministic universal law, independent of the manifold. Some of the…

The characteristic polynomial of the effective Hamiltonian for a general model has been discussed. It is found that, compared with the associated energy eigenvalues, this characteristic polynomial generally has better analytical properties…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written…

Let Y be a random variable such that the moment generating function of Y exists in a neighborhood of the origin. The aim of this paper is to study probabilistic versions of the derangement polynomials, the derangement polynomials of type 2…

Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

This is a review of the Riemann-Hilbert approach to the large $N$ asymptotics in random matrix models and its applications. We discuss the following topics: random matrix models and orthogonal polynomials, the Riemann-Hilbert approach to…