Related papers: Schur expansion of random-matrix reproducing kerne…

The averages of ratios of characteristic polynomials det(lambda - X) of N x N random matrices X, are investigated in the large N limit for the GUE, GOE and GSE ensemble. The density of states and the two-point correlation function are…

The Bernstein operators allow to build recursively the Schur functions. We present a recursion formula for k-Schur functions at t=1 based on combinatorial operators that generalize the Bernstein operators. The recursion leads immediately to…

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…

We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…

We investigate training and using Gaussian kernel SVMs by approximating the kernel with an explicit finite- dimensional polynomial feature representation based on the Taylor expansion of the exponential. Although not as efficient as the…

In this paper we study generalized J-inner matrix valued functions which appear as resolvent matrices in various indefinite interpolation problems. Reproducing kernel indefinite inner product spaces associated with a generalized J-inner…

Ensembles of complex symmetric, and complex self dual random matrices are known to exhibit local statistical properties distinct from those of the non-Hermitian Ginibre ensembles. On the other hand, in distinction to the latter, the joint…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…

Stochastic expansion-based methods of uncertainty quantification, such as polynomial chaos and separated representations, require basis functions orthogonal with respect to the density of random inputs. Many modern engineering problems…

Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review basic properties and recent developments of…

We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…

We derive a series summation formula for the average logarithm norm of the action of a matrix on the projective space. This formula is shown to be useful to evaluate some Lyapunov exponents of random $\SL$-matrix cocycles, which include a…

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

For the Schur polynomials bounded and unbounded generalizations of the Cauchy identities are found.

H. Widom derived formulae expressing correlation functions of orthogonal and symplectic ensembles of random matrices in terms of orthogonal polynomials (H. Widom. J. Stat. Phys. 94, (1999) 347-363). We obtain similar results for discrete…

We give formulas for the products of classes of Schubert varieties in the quantum cohomology rings of Grassmannians, in terms of the combinatorics of partitions and tableaux.

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…