Related papers: Probabilistic measures and algorithms arising from…

The classical Littlewood-Richardson rule is a rule for computing coefficients in many areas, and comes in many guises. In this paper we prove two Littlewood-Richardson rules for symmetric skew quasisymmetric Schur functions that are…

Starting from an integrable rank-$n$ vertex model, we construct an explicit family of partition functions indexed by compositions $\mu = (\mu_1,\dots,\mu_n)$. Using the Yang-Baxter algebra of the model and a certain rotation operation that…

The concept of time emerges as an ordering structure in a classical statistical ensemble. Probability distributions $p_\tau(t)$ at a given time $t$ obtain by integrating out the past and future. We discuss all-time probability distributions…

Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_\lambda$ arise as partition functions of certain path configurations in the $\mathfrak{sl}_2$ higher spin six vertex models. They are multiparameter generalizations of…

Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

Given a model in algebraic statistics and some data, the likelihood function is a rational function on a projective variety. Algebraic algorithms are presented for computing all critical points of this function, with the aim of identifying…

As shown in our paper [JCTA 177 (2021), Paper No. 105305], the chromatic quasi-symmetric function of Shareshian-Wachs can be lifted to ${\bf WQSym}$, the algebra of quasi-symmetric functions in noncommuting variables. We investigate here…

We study scaling limits of periodically weighted skew plane partitions with semilocal interactions and general boundary conditions. The semilocal interactions correspond to the Macdonald symmetric functions which are $(q,t)$-deformations of…

Using the Lax operator formalism, we construct a family of pairwise commuting operators such that the Macdonald symmetric functions of infinitely many variables and of two parameters $q,t$ are their eigenfunctions. We express our operators…

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…

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

The Born probability measure describes the statistics of measurements in which observers self-locate themselves in some region of reality. In $\psi$-ontic quantum theories, reality is directly represented by the wavefunction. We show that…

Jack polynomials generalize several classical families of symmetric polynomials, including Schur polynomials, and are further generalized by Macdonald polynomials. In 1989, Richard Stanley conjectured that if the Littlewood-Richardson…

We demonstrate in some detail how Macdonald polynomials emerge from the recently introduced 3-Schur functions when the plane-partition vector time-variables are projected onto the ordinary scalar times under non-vanishing angles, which…

The identities which are in the literature often called ``bounded Littlewood identities" are determinantal formulas for the sum of Schur functions indexed by partitions with bounded height. They have interesting combinatorial consequences…

The additivity of classical probabilities is only the first in a hierarchy of possible sum-rules, each of which implies its successor. The first and most restrictive sum-rule of the hierarchy yields measure-theory in the Kolmogorov sense,…

The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing…

We explore some probabilistic applications arising in connections with $K$-theoretic symmetric functions. For instance, we determine certain corner distributions of random lozenge tilings and plane partitions. We also introduce some…