Related papers: A Probabilistic Proof of the Rogers Ramanujan Iden…
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
Rogers-Ramanujan type identities occur in various branches of mathematics and physics. As a classic and powerful tool to deal with Rogers-Ramanujan type identities, the theory of Bailey's lemma has been extensively studied and generalized.…
A generalized Bailey pair, which contains several special cases considered by Bailey (\emph{Proc. London Math. Soc. (2)}, 50 (1949), 421--435), is derived and used to find a number of new Rogers-Ramanujan type identities. Consideration of…
A multiparameter generalization of the Bailey pair is defined in such a way as to include as special cases all Bailey pairs considered by W. N. Bailey in his paper, "Identities of the Rogers-Ramanujan type," [Proc. London Math. Soc. (2), 50…
Understanding and predicting how complex systems respond to external perturbations is a central challenge in nonequilibrium statistical physics. Here we consider continuous-time Markov networks, which we subject to perturbations along a…
This article constructs a class of random probability measures based on exponentially and polynomially tilting operated on the laws of completely random measures. The class is proved to be conjugate in that it covers both prior and…
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 consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
The Rogers-Ramanujan identities have been studied from the viewpoints of combinatorics, number theory, affine Lie algebras, statistical mechanics, and quantum field theory. This note connects the Rogers-Ramanujan identities with the finite…
We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…
Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…
It is shown that (two-variable generalizations of) more than half of Slater's list of 130 Rogers-Ramanujan identities (L. J. Slater, Further identities of the Rogers-Ramanujan type, \emph{Proc. London Math Soc. (2)} \textbf{54} (1952),…
We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…
The $\mathrm{A}_2$ Bailey chain of Andrews, Schilling and the author is extended to a four-parameter $\mathrm{A}_2$ Bailey tree. As main application of this tree, we prove the Kanade-Russell conjecture for a three-parameter family of…
We revisit the solvable lattice models described by Andrews Baxter and Forrester and their generalizations. The expressions for the local state probabilities were shown to be related to characters of the minimal models. We recompute these…
The theory of Bailey's transform provides a systematic method for deriving $q$-identities, the key factor of which is the Bailey pair. The concept of Bailey pair was first extended to bilateral version by Paule. In this paper, following…