Related papers: Hall-Littlewood RSK field
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…
We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule…
The family of multivariate skew-normal distributions has many interesting properties. It is shown here that these hold for a general class of skew-elliptical distributions. For this class, several stochastic representations are established…
We prove that the joint distribution of the values of the height function for the stochastic six vertex model in a quadrant along a down-right path coincides with that for the lengths of the first columns of partitions distributed according…
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 Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
We study the effect of linear transformations on quantum fields with applications to vertex operator presentations of symmetric functions. Properties of linearly transformed quantum fields and corresponding transformations of…
The foremost aim of this study is to introduce and study several combinatorial properties and highlight specific aspects of a new class of polynomials sequences known as degenerate Krawtchouk Appell polynomials associated with the…
We study Hall-Littlewood polynomials using an integrable lattice model of $t$-deformed bosons. Working with row-to-row transfer matrices, we review the construction of Hall-Littlewood polynomials (of the $A_n$ root system) within the…
This work introduces a novel algorithm to solve large-scale eigenvalue problems and seek a small set of eigenpairs. The method, called randomized Krylov-Schur (rKS), has a simple implementation and benefits from fast and efficient…
Randomized algorithms provide solutions to two ubiquitous problems: (1) the distributed calculation of a principal component analysis or singular value decomposition of a highly rectangular matrix, and (2) the distributed calculation of a…
We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…
We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…
We present a novel approach to identify potential dispersed signals of new physics in the slew of published LHC results. It employs a random walk algorithm to introduce sets of new particles, dubbed "proto-models", which are tested against…
By analyzing an optimization problem over orthogonal matrices, we prove a generalization of the Hardy-Littlewood-P\'olya rearrangement inequality to positive definite matrices. The inequality is then extended to rectangular matrices. Using…
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…
Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_\lambda$ are multiparameter deformations of the classical Hall-Littlewood symmetric polynomials and can be viewed as partition functions in $\mathfrak{sl}(2)$ higher…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
This short course offers a new perspective on randomized algorithms for matrix computations. It explores the distinct ways in which probability can be used to design algorithms for numerical linear algebra. Each design template is…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…