Related papers: Finite free convolutions via Weingarten calculus
We prove that any non commutative polynomial of r independent copies of Wigner matrices converges a.s. towards the polynomial of r free semicircular variables in operator norm. This result extends a previous work of Haagerup and…
Recently subclasses of polynomial ensembles for additive and multiplicative matrix convolutions were identified which were called P\'olya ensembles (or polynomial ensembles of derivative type). Those ensembles are closed under the…
We establish a link between free probability theory and Witt vectors, via the theory of formal groups. We derive an exponential isomorphism which expresses Voiculescu's free multiplicative convolution $\boxtimes$ as a function of the free…
I give a survey about my work on combinatorial and probabilistic aspects of free probability theory. In particular, I present the combinatorial description of freeness in terms of free cumulants and I give some ideas of the main results of…
It has been shown by Voiculescu and Biane that the analytic subordination property holds for free additive and multiplicative convolutions. In this paper, we present an operatorial approach to subordination for free multiplicative…
Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…
Debbah and Ryan have recently proved a result about the limit empirical singular distribution of the sum of two rectangular random matrices whose dimensions tend to infinity. In this paper, we reformulate it in terms of the rectangular free…
In this paper we construct scalar cumulants for stable random matrix models with single trace interactions of arbitrarily high even order by Weingarten calculus. We obtain explicit and convergent expansions for these scalar cumulants in the…
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…
Covariant or invariant functions under a compact linear group can be expressed in terms of functions defined in the orbit space of the group. The semialgebraic relations defining the orbit spaces of all finite coregular real linear groups…
We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…
Explicit convergence of suitably normalized integrals on balls where the integrand is the product of coefficients of the quasi-regular representation of the finitely generated free group.
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial…
The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…
This article is devoted to the study of several algebras which are related to symmetric functions, and which admit linear bases labelled by various combinatorial objects: permutations (free quasi-symmetric functions), standard Young…
By representing elements in free fields (over a commutative field and a finite alphabet) using Cohn and Reutenauer's linear representations, we provide an algorithmic construction for the (partial) non-commutative (or Hausdorff-) derivative…
In this paper, we construct the pair of finite bivariate biorthogonal M-Konhauser polynomials, reduced to the finite orthogonal polynomials $M_{n}^{(p,q)}(t)$, by choosing appropriate parameters in order to obtain a relation between the…
It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…