Related papers: A combinatorial model for $\nabla m_\mu$
We prove the equivalence of two conjectural constructions of unramified cuspidal automorphic functions on the adelic group GL_n(A) associated to an irreducible l-adic local system of rank n on an algebraic curve X over a finite field. The…
A weight function which $q$-generalizes the ground state wave function of the multi-component Calogero-Sutherland quantum many body system is introduced. Conjectures, and some proofs in special cases, are given for a constant term identity…
\begin{abstract} This paper deals with an extremal problem for bounded harmonic functions in the unit ball $\mathbb{B}^n.$ We solve the Khavinson conjecture in $\mathbb{R}^3,$ an intriguing open question since 1992 posed by D. Khavinson,…
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…
We introduce a new family of operators as multi-parameter deformation of the one-row Macdonald polynomials. The matrix coefficients of these operators acting on the space of symmetric functions with rational coefficients in two parameters…
Let W be the complex reflection group G(e,1,n). In the author's previous paper, Hall-Littlewood functions associated to W were introduced. In the special case where W is a Weyl group of type B_n, they are closely related to Green…
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…
We give again (see also arXiv:1112.0676) a proof of weighted estimate of any Calder\'on-Zygmund operator. This is under a universal sharp sufficient condition that is weaker than the so-called bump condition. Bump conjecture was recently…
We generalize a map by S. Mason regarding two combinatorial models for key polynomials, in a way that accounts for the major index. We also define similar variants of this map, that regards alternative models for the modified Macdonald…
A recent 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 a pair of statistics on fillings of Young diagrams. Ram and…
In this paper, we investigate the Schur positivity of modified Hall--Littlewood polynomials indexed by two-column partitions under the action of the $\nabla$ operator. Specifically, we resolve two conjectures posed by Bergeron, Garsia,…
We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…
In a recent paper, Merca posed three conjectures on congruences for specific convolutions of a sum of odd divisor functions with a generating function for generalized $m$-gonal numbers. Extending Merca's work, we complete the proof of these…
Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a}…
In the paper we formulate and verify a difference counterpart of the Macdonald-Mehta conjecture and its generalization for the Macdonald polynomials. Namely, we determine the Fourier transforms of the polynomials multiplied by the Gaussian,…
We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
We give a recursive definition of generalized parking function that allows us to view them as a species. From there we compute a non-commutative characteristic of the generalized parking function module, and deduce some enumeration formulas…
This paper describes a combinatorial way of obtaining all the eigenvalues of the symmetrized shuffling operators introduced by Victor Reiner, Franco Saliola and Volkmar Welker. It allows us to prove their conjecture that these eigenvalues…