English
Related papers

Related papers: Rhombic staircase tableaux and Koornwinder polynom…

200 papers

A one-parameter generalisation R_{\lambda}(X;b) of the symmetric Macdonald polynomials and interpolations Macdonald polynomials is studied from the point of view of branching rules. We establish a Pieri formula, evaluation symmetry,…

Combinatorics · Mathematics 2011-12-15 Alain Lascoux , S. Ole Warnaar

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a…

Combinatorics · Mathematics 2026-05-15 Youssouf Wirdane

This is a paper about $c$-functions and Macdonald polynomials. There are $c$-function formulas for $E$-expansions of $P_\lambda$ and $A_{\lambda+\rho}$, principal specializations of $P_\lambda$ and $E_\mu$, for Macdonald's constant term…

Combinatorics · Mathematics 2022-12-08 Laura Colmenarejo , Arun Ram

Spin $q$-Whittaker symmetric polynomials labeled by partitions $\lambda$ were recently introduced by Borodin and Wheeler (arXiv:1701.06292) in the context of integrable $\mathfrak{sl}_2$ vertex models. They are a one-parameter deformation…

Probability · Mathematics 2020-04-21 Matteo Mucciconi , Leonid Petrov

In this paper, we introduce the rhombic alternative tableaux, whose weight generating functions provide combinatorial formulae to compute the steady state probabilities of the two-species ASEP. In the ASEP, there are two species of…

Combinatorics · Mathematics 2016-09-27 Olya Mandelshtam , Xavier Viennot

The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This…

Combinatorics · Mathematics 2021-09-14 Cara Monical , Oliver Pechenik , Travis Scrimshaw

A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…

Combinatorics · Mathematics 2022-10-04 Jang Soo Kim , Dennis Stanton

The paper is mainly devoted to the irreducibility of the polynomial representation of the double affine Hecke algebra for an arbitrary reduced root systems and generic "central charge" q. The technique of intertwiners in the non-semisimple…

Quantum Algebra · Mathematics 2008-11-01 Ivan Cherednik

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

q-alg · Mathematics 2008-02-03 Friedrich Knop , Siddhartha Sahi

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…

Combinatorics · Mathematics 2019-02-20 Pawel Hitczenko , Svante Janson

We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…

High Energy Physics - Theory · Physics 2024-08-09 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…

Combinatorics · Mathematics 2018-01-18 Alan J. Cain , António Malheiro , Fábio M. Silva

The colored HOMFLY polynomials, which describe Wilson loop averages in Chern-Simons theory, possess an especially simple representation for torus knots, which begins from quantum R-matrix and ends up with a trivially-looking split W…

High Energy Physics - Theory · Physics 2016-12-07 P. Dunin-Barkowski , A. Mironov , A. Morozov , A. Sleptsov , A. Smirnov

In this paper we use the double affine Hecke algebra to compute the Macdonald polynomial products $E_\ell P_m$ and $P_\ell P_m$ for type $SL_2$ and type $GL_2$ Macdonald polynomials. Our method follows the ideas of Martha Yip but executes a…

Representation Theory · Mathematics 2023-10-18 Aritra Bhattacharya , Arun Ram

In this paper, we study staircase tableaux, a combinatorial object introduced due to its connections with the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. Due to their interesting connections, staircase tableaux have…

Combinatorics · Mathematics 2015-09-21 Pawel Hitczenko , Amanda Lohss

We say that the polynomial sequence $(Q^{(\lambda)}_n)$ is a semiclassical Sobolev polynomial sequence when it is orthogonal with respect to the inner product $$ <p, r>_S=<{{\bf u}} ,{p\, r}> +\lambda <{{\bf u}}, {{\mathscr D}p \,{\mathscr…

Classical Analysis and ODEs · Mathematics 2011-09-06 R. S. Costas-Santos , J. J. Moreno-Balcázar

The K-theoretic quiver component formula expresses the K-polynomial of a type A quiver locus as an alternating sum of products of double Grothendieck polynomials. This formula was conjectured by A. Buch and R. Rim\'anyi and later proved by…

Combinatorics · Mathematics 2025-03-14 Aidan Lindberg , Jenna Rajchgot

In this article, we prove a tableau formula for the double Grothendieck polynomials associated to $321$-avoiding permutations. The proof is based on the compatibility of the formula with the $K$-theoretic divided difference operators.

Combinatorics · Mathematics 2017-11-02 Tomoo Matsumura

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…

Combinatorics · Mathematics 2011-01-20 Matthieu Josuat-Vergès