Related papers: Probabilistic measures and algorithms arising from…
Parametric families in the centre ${\bf Z}({\bf C}[S_n])$ of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements.…
Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics.…
We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.
A simple position probability density formulation is presented for the motion of a particle in a spherically symmetric potential. The approach provides an alternative to Newtonian methods for presentation in an elementary course, and…
Macdonald processes are certain probability measures on two-dimensional arrays of interlacing particles introduced by Borodin and Corwin (arXiv:1111.4408 [math.PR]). They are defined in terms of nonnegative specializations of the Macdonald…
It is well known that if one integrates a Schur function indexed by a partition $\lambda$ over the symplectic (resp. orthogonal) group, the integral vanishes unless all parts of $\lambda$ have even multiplicity (resp. all parts of $\lambda$…
We present a categorical viewpoint of probability measures by showing that a probability measure can be viewed as a weakly averaging affine measurable functional taking values in the unit interval which preserves limits. The probability…
This article serves as an introduction to several recent developments in the study of quasisymmetric functions. The focus of this survey is on connections between quasisymmetric functions and the combinatorial Hopf algebra of noncommutative…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
Comparing probability distributions is a core challenge across the natural, social, and computational sciences. Existing methods, such as Maximum Mean Discrepancy (MMD), struggle in high-dimensional and non-compact domains. Here we…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are…
We show that the partition functions which enumerate Donaldson-Thomas invariants of local toric Calabi-Yau threefolds without compact divisors can be expressed in terms of specializations of the Schur measure. We also discuss the relevance…
At large quantum numbers, the probability densities for particle-in-a-box or simple harmonic oscillator converge to the classical result upon coarse-graining the quantum mechanical probability densities by introducing a finite resolution in…
We establish a fundamental connection between the geometric RSK correspondence and GL(N,R)-Whittaker functions, analogous to the well known relationship between the RSK correspondence and Schur functions. This gives rise to a natural family…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a…
We study Sorkin's proposal of a generalization of quantum mechanics and find that the theories proposed derive their probabilities from $k$-th order polynomials in additive measures, in the same way that quantum mechanics uses a probability…
For a subfamily of multiplicative measures on integer partitions we give conditions for properly rescaled associated Young diagrams to converge in probability to a certain deterministic curve named the limit shape of partitions. We provide…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
We use Rogers-Szego polynomials to unify some well-known identities for Hall-Littlewood symmetric functions due to Macdonald and Kawanaka.