Related papers: Averaging method in combinatorics of symmetric pol…
Normal crystals (also known as Stembridge crystals) are commonly used to establish the Schur positivity of symmetric functions, as their characters are sums of Schur polynomials. In this paper, we develop a combinatorial framework for a…
In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…
This paper aims to construct a new family of numbers and polynomials which are related to the Bell numbers and polynomials by means of the confluent hypergeometric function. We give various properties of these numbers and polynomials…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
In this paper, we find bounds for the eigenvalues of matrix polynomials. In particular, we find generalizations of Cauchy's classical Theorem for distribution of eigenvalues of matrix polynomial.
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
We develop a new framework to compute the exact correlators of characteristic polynomials, and their inverses, in random matrix theory. Our results hold for general potentials and incorporate the effects of an external source. In matrix…
The shifted Plancherel measure is a natural probability measure on strict partitions. We prove a polynomiality property for the averages of the shifted Plancherel measure. As an application, we give alternative proofs of some content…
A "flip-and-reversal" involution arising in the study of quasisymmetric Schur functions provides a passage between what we term "Young" and "reverse" variants of bases of polynomials or quasisymmetric functions. Building on this…
It has been shown recently [10] that Cauchy transforms of orthogonal polynomials appear naturally in general correlation functions containing ratios of characteristic polynomials of random NxN Hermitian matrices. Our main goal is to…
This publication is an exercise which extends to two variables the Christoffel's construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We…
We derive two new generalizations of the Busche-Ramanujan identities involving the multiple Dirichlet convolution of arithmetic functions of several variables. The proofs use formal multiple Dirichlet series and properties of symmetric…
We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…
In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…
The partial averaging technique is defined and used in conjunction with the random series implementation of the Feynman-Kac formula. It enjoys certain properties such as good rates of convergence and convergence for potentials with…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
Recently, Komastu introduced the concept of poly-Cauchy numbers and polynomials which generalize Cauchy numbers and polynomials. In this paper, we introduce new generaliza- tion of poly-Cauchy and poly-Bernoulli numbers and polynomials.…
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…
We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…