相关论文: Universality of free random variables: atoms for n…
We characterize asymptotic collective behaviour of rectangular random matrices, the sizes of which tend to infinity at different rates: when embedded in a space of larger square matrices, independent rectangular random matrices are…
Suppose p is a symmetric matrix whose entries are polynomials in freely noncommutating variables and p(0) is positive definite. Let D(p) denote the component of zero of the set of those g-tuples X of symmetric matrices (of the same size)…
Let $r$ be a nonconstant noncommutative rational function in $m$ variables over an algebraically closed field $K$ of characteristic 0. We show that for $n$ large enough, there exists an $X\in M_n(K)^m$ such that $r(X)$ has $n$ distinct and…
Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…
We prove the existence of a non-trivial hyperinvariant subspace for several sets of polynomially compact operators. The main results of the paper are: (i) a non-trivial norm closed algebra $\mathcal A\subseteq \mathcal B(\mathscr X)$ which…
In an infinitesimal probability space we consider operators which are infinitesimally free and one of which is infinitesimal, in that all its moments vanish. Many previously analysed random matrix models are captured by this framework. We…
In this paper we consider several problems of joint similarity to tuples of bounded linear operators in noncommutative polydomains and varieties associated with sets of noncommutative polynomials. We obtain analogues of classical results…
This paper concerns analytic free maps. These maps are free analogs of classical analytic functions in several complex variables, and are defined in terms of non-commuting variables amongst which there are no relations - they are free…
We study the asymptotics of sums of matricially free random variables called random pseudomatrices, and we compare it with that of random matrices with block-identical variances. For objects of both types we find the limit joint…
We propose a one-dimensional nonintegrable spin model with local interactions that covers Dyson's three symmetry classes (classes A, AI, and AII) depending on the values of parameters. We show that the nearest-neighbor spacing distribution…
We say that a symmetric noncommutative polynomial in the noncommutative free variables (x_1, x_2, ..., x_g) is noncommutative plurisubharmonic on a noncommutative open set if it has a noncommutative complex hessian that is positive…
We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…
We develop the basic theory of eigenvalues of $p$-adic random matrices, analogous to the classical theory for random matrices over $\mathbb{R}$ and $\mathbb{C}$. Such eigenvalue statistics were proposed as a model for the zeroes of $p$-adic…
Given two rational maps $f,g: \mathbb{P}^1 \to \mathbb{P}^1$ of degree $d$ over $\mathbb{C}$, DeMarco-Krieger-Ye [DKY22] has conjectured that there should be a uniform bound $B = B(d) > 0$ such that either they have at most $B$ common…
In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…
Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
An algorithm for unconstrained non-convex optimization is described, which does not evaluate the objective function and in which minimization is carried out, at each iteration, within a randomly selected subspace. It is shown that this…
In this paper, it is shown that with large probability, the spectral radius of a large non-Hermitian random matrix with a general variance profile does not exceed the square root of the spectral radius of the variance profile matrix. A…
In this paper we deal with analytic nonautonomous vector fields with a periodic time-dependancy, that we study near an equilibrium point. In a first part, we assume that the linearized system is split in two invariant subspaces E0 and E1.…