Related papers: Modified Macdonald polynomials and the multispecie…
We describe a way to study and compute Pieri rules for wreath Macdonald polynomials using the quantum toroidal algebra. The Macdonald pairing can be naturally generalized to the wreath setting, but the wreath Macdonald polynomials are no…
Wreath Macdonald polynomials arise from the geometry of $\Gamma$-fixed loci of Hilbert schemes of points in the plane, where $\Gamma$ is a finite cyclic group of order $r\ge 1$. For $r=1$, they recover the classical (modified) Macdonald…
We introduce and study several random combinatorial billiard trajectories. Such a system, which depends on a fixed parameter $p\in(0,1)$, models a beam of light that travels in a Euclidean space, occasionally randomly reflecting off of a…
We introduce a new family of operators as multi-parameter deformation of the one-row Macdonald polynomials. The matrix coefficients of these operators acting on the space of symmetric functions with rational coefficients in two parameters…
Macdonald processes are measures on sequences of integer partitions built using the Cauchy summation identity for Macdonald symmetric functions. These measures are a useful tool to uncover the integrability of many probabilistic systems,…
We investigate the homogeneous symmetric Macdonald polynomials $P_\lambda(\X;q,t)$ for the specialization $t=q^k$. We show an identity relying the polynomials $P_\lambda(\X;q,q^k)$ and $P_\lambda(\frac{1-q}{1-q^k}\X;q,q^k)$. As a…
A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. The…
We consider a stationary Markov process that models certain queues with a bulk service of a fixed number $m$ of admitted customers. We find an integral expression of its transition probability function in terms of certain multi-orthogonal…
The Quantum Symmetric Simple Exclusion Process (QSSEP) is a model of quantum particles hopping on a finite interval and satisfying the exclusion principle. Recently Bernard and Jin have studied the fluctuations of the invariant measure for…
In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals…
The discrete-time Toda equation arises as a universal equation for the relevant Hankel determinants associated with one-variable orthogonal polynomials through the mechanism of adjacency, which amounts to the inclusion of shifted weight…
We introduce and study q-randomized Robinson-Schensted-Knuth (RSK) correspondences which interpolate between the classical (q=0) and geometric (q->1) RSK correspondences (the latter ones are sometimes also called tropical). For 0<q<1 our…
In this paper we present methods for the synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariants in the form of polynomials over program variables, which…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon…
In this work we study the relationship between several combinatorial formulas for type $A$ spherical Whittaker functions. These are spherical functions on $p$-adic groups, which arise in the theory of automorphic forms. They depend on a…
We consider the discrete Hammersley-Aldous-Diaconis process (HAD) and the totally asymmetric simple exclusion process (TASEP) in Z. The basic coupling induces a multiclass process which is useful in discussing shock measures and other…
We prove a combinatorial formula for Macdonald cumulants which generalizes the celebrated formula of Haglund for Macdonald polynomials. We provide several applications of our formula. Firstly, it gives a new, constructive proof of a strong…
Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in HMC simulations. The use of a multiple time-scale integration scheme allows the filtered pseudofermions to be…
A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for…