相关论文: A combinatorial formula for non-symmetric Macdonal…
In this paper, we establish Newton-Maclaurin type inequalities for functions arising from linear combinations of primitively symmetric polynomials. This generalization extends the classical Newton-Maclaurin inequality to a broader class of…
Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…
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…
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:…
We prove a combinatorial formula for the alternating descent polynomials of type A and B. Combining with Josuat-Verg\`es' combinatorial interpretation for Hoffman's derivative polynomials for tangent and secant functions, we obtain a…
The non-commutative five-term relation $T_{1,0} T_{0,1} = T_{0,1} T_{1,1} T_{1,0}$ is shown to hold for certain operators acting on symmetric functions. The "generalized recursion" conjecture of Bergeron and Haiman is a corollary of this…
Let $W^c(A_n)$ be the set of fully commutative elements of the Coxeter group $W(A_n)$. Let $$ a_n(q)= \sum_{w \in W^c(A_n)} q^{l(w)} . $$ We compute $a_n(q)$.
The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…
We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.
New sequences of discrete orthogonal polynomials associated with the modified Bessel function $K_\mu(z)$ or Macdonald function are considered. The corresponding weight function is $\lambda^k \rho_{k+\nu+1}(t)/ k!$, where $\ k \in…
We introduce Macdonald characters and use algebraic properties of Macdonald polynomials to study them. As a result, we produce several formulas for Macdonald characters, which are generalizations of those obtained by Gorin and Panova in…
We present a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a Riemann surface of genus g to…
We conjecture a formula for the rational $q,t$-Catalan polynomial $\mathcal{C}_{r/s}$ that is symmetric in $q$ and $t$ by definition. The conjecture posits that $\mathcal{C}_{r/s}$ can be written in terms of symmetric monomial strings…
Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics.…
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…