Related papers: Comparing formulas for type $GL_n$ Macdonald polyn…
The incomplete version of the Macdonald function has various appellations in literature and earns a well-deserved reputation of being a computational challenge. This paper ties together the previously disjoint literature and presents the…
We present an explicit formula for the transition matrix $\mathcal{C}$ from the type $C_n$ degeneration of the Koornwinder polynomials $P_{(1^r)}(x\,|\,a,-a,c,-c\,|\,q,t)$ with one column diagrams, to the type $C_n$ monomial symmetric…
Elliptic Macdonald polynomials of sl(2)-type and level 2 are introduced. Suitable limits of elliptic Macdonald polynomials are the standard Macdonald polynomials and conformal blocks. Identities for elliptic Macdonald polynomials, in…
In this paper we obtain the formal asymptotic expansion of the logarithms $\ln p_s(\alpha)$ of $p_s(\alpha)$, which are canonical continuations of polynomials of binomial type $p_n(\alpha)$. Our approach is based on linear methods which do…
This paper is a continuation of our papers [EK1, EK2]. In [EK2] we showed that for the root system A_n-1 one can obtain Macdonald's polynomials - a new interesting class of symmetric functions recently defined by I. Macdonald {M1] - as…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a…
We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which…
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
Non-attacking skyline fillings were used by Haglund, Haiman and Loehr to establish a combinatorial formula for nonsymmetric Macdonald polynomials. Semistandard skyline fillings are non-attacking skyline fillings with both major index and…
Using a power sum (boson) realization for the Macdonald operators, we investigate the Gukov, Iqbal, Kozcaz and Vafa (GIKV) proposal for the homological invariants of the colored Hopf link, which include Khovanov-Rozansky homology as a…
We propose an extension of the join calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a…
We consider 3-parametric polynomials which replace the A-series interpolation Macdonald polynomials in the BC case. For these polynomials, we prove: an integral representation, a combinatorial formula, Pieri-type rules, Cauchy identity, and…
Combinatorial objects called rigged configurations give rise to q-analogues of certain Littlewood-Richardson coefficients. The Kostka-Foulkes polynomials and two-column Macdonald-Kostka polynomials occur as special cases. Conjecturally…
Graph Neural Networks (GNNs) have become important machine learning tools for graph analysis, and its explainability is crucial for safety, fairness, and robustness. Layer-wise relevance propagation for GNNs (GNN-LRP) evaluates the…
In the basic representation of $U_q(\hat{sl}(2))$ realized via the algebra of symmetric functions we compare the canonical basis with the basis of Macdonald polynomials with $q=t^2$. We show that the Macdonald polynomials are invariant with…
The set of n by n upper-triangular nilpotent matrices with entries in a finite field F_q has Jordan canonical forms indexed by partitions lambda of n. We present a combinatorial formula for computing the number F_\lambda(q) of matrices of…
Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group $\textup{GL}(V)$, where $V=\mathbb R^d$. Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq…
We prove Macdonald-type deformations of a number of well-known classical branching rules by employing identities for elliptic hypergeometric integrals and series. We also propose some conjectural branching rules and allied conjectures…
We prove a Macdonald polynomial analogue of the celebrated Nekrasov-Okounkov hook-length formula from the theory of random partitions. As an application we obtain a proof of one of the main conjectures of Hausel and Rodriguez-Villegas from…