Related papers: Probabilistic measures and algorithms arising from…
Discrete orthogonality relations for Hall-Littlewood polynomials are employed, so as to derive cubature rules for the integration of homogeneous symmetric functions with respect to the density of the circular unitary ensemble (which…
There are representations of the type-A Hecke algebra on spaces of polynomials in anti-commuting variables. Luque and the author [S\'em. Lothar. Combin. 66 (2012), Art. B66b, 68 pages, arXiv:1106.0875] constructed nonsymmetric Macdonald…
We investigate the connections between various noncommutative analogues of Hall-Littlewood and Macdonald polynomials, and define some new families of noncommutative symmetric functions depending on two sequences of parameters.
We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…
The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
The characteristic map for the symmetric group is an isomorphism relating the representation theory of the symmetric group to symmetric functions. An analogous isomorphism is constructed for the symmetric space of symplectic forms over a…
This paper is about a family of symmetric rational functions that form a one-parameter generalization of the classical Hall-Littlewood polynomials. We introduce two sets of (skew and non-skew) functions that are akin to P and Q…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Quantification starts with sum and product rules that express combination and partition. These rules rest on elementary symmetries that have wide applicability, which explains why arithmetical adding up and splitting into proportions are…
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…
We establish a ring isomorphism between the derived Hall algebra of the Jordan quiver and the ring of double symmetric functions (i.e., the ring of symmetric polynomials in two sets of countably many variables, invariant under the…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
We generalize the generating formula for plane partitions known as MacMahon's formula as well as its analog for strict plane partitions. We give a 2-parameter generalization of these formulas related to Macdonald's symmetric functions. The…
We construct generalized regular representations of the wreath product of a compact group with the infinite symmetric group. The characters of these representations are determined by probability measures on families of partitions called the…
Functionals in geometric probability are often expressed as sums of bounded functions exhibiting exponential stabilization. Methods based on cumulant techniques and exponential modifications of measures show that such functionals satisfy…
TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target)…
We propose periodic Macdonald processes as a $(q,t)$-deformation of periodic Schur processes and a periodic analogue of Macdonald processes. It is known that, in the theory of stochastic processes related to a family of symmetric functions,…
The shifted Schur measure introduced by Tracy and Widom is a measure on the set of all strict partitions, which is defined by Schur $Q$-functions. The main aim of this paper is to calculate the correlation function of this measure, which is…