Related papers: A three shuffle case of the compositional parking …

We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…

We investigate the homogeneous symmetric Macdonald polynomials $P_\lambda(\X;q,t)$ for the specialization $t=q^k$. We show an identity relying the polynomials $P_\lambda(\X;q,q^k)$ and $P_\lambda(\frac{1-q}{1-q^k}\X;q,q^k)$. As a…

A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for…

A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…

We study the space, $R_m$, of $m$-symmetric functions consisting of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},x_{m+3},\dots$ but have no special symmetry in the variables $x_1,\dots,x_m$. We obtain $m$-symmetric…

Motivated by the combinatorics of parking functions and their several generalizations, we study the Ehrhart theory of Pitman--Stanley polytopes. We prove a strong positivity phenomenon called \emph{magic positivity} for the Ehrhart…

In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

The modified Macdonald functions $\widetilde{H}_{\mu}$ are fundamental objects in modern algebraic combinatorics. Haiman showed that there is a correspondence between the $(\mathbb{C}^{*})^2$-fixed points $I_{\mu}$ of the Hilbert schemes…

Quite some years ago, Oleg Chalykh has built a nice theory from the observation that the Macdonald polynomial reduces at $t=q^{-m}$ to a sum over permutations of simpler polynomials called Baker-Akhiezer functions, which can be…

An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…

We propose a conjectural $q$-analogue of the classical duality for iterated integrals on $\mathbb{P}^{1}$ minus four points, arising from the involutive M\"{o}bius transformation which exchanges the four marked points in pairs. To this end,…

In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ and integral Macdonald polynomials $J_{\lambda}(X;q,t)$, in terms of several new statistics and the major index for a partition…

Wreath Macdonald polynomials arise from the geometry of $\Gamma$-fixed loci of Hilbert schemes of points in the plane, where $\Gamma$ is a finite cyclic group of order $r\ge 1$. For $r=1$, they recover the classical (modified) Macdonald…

In this work we study conditional monotone cumulants and additive convolution in the shuffle-algebraic approach to non-commutative probability. We describe c-monotone cumulants as an infinitesimal character and identify the c-monotone…

In this paper, a link between $q$-difference equations, Jacobi operators and orthogonal polynomials is given. Replacing the variable $x$ by $ q^{-n}$ in a Sturm-Liouville $q$-difference equation we discovered the Jacobi operator. With…

Macdonald defined two-parameter Kostka functions K_{\lambda\mu}(q,t) where \lambda, \mu are partitions. The main purpose of this paper is to extend his definition to include all compositions as indices. Following Macdonald, we conjecture…

We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number…

We prove the logarithmic Sarnak conjecture for sequences of subquadratic word growth. In particular, we show that the Liouville function has at least quadratically many sign patterns. We deduce the main theorem from a variant which bounds…

We classify recurrent configurations of the sandpile model on the complete bipartite graph K_{m,n} in which one designated vertex is a sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes…