相关论文: Bijective proofs of some coinversion identities re…
Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms…
We prove a binomial formula for Macdonald polynomials and consider applications of it.
Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…
We give an explicit raising operator formula for the modified Macdonald polynomials $\tilde{H}_{\mu }(X;q,t)$, which follows from our recent formula for $\nabla$ on an LLT polynomial and the Haglund-Haiman-Loehr formula expressing modified…
We obtain a bijection between certain lattice paths and partitions. This implies a proof of polynomial identities conjectured by Melzer. In a limit, these identities reduce to Rogers--Ramanujan-type identities for the…
Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but no bijective proof for any of these equivalences has been…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
I use polynomial analogue of the Jacobi triple product identity together with the Eisenstein formula for the Legendre symbol modulo 3 . to prove six identities involving the $q$-binomial coefficients. These identities are then extended to…
The McKay Conjecture (MC) asserts the existence of a bijection between the (inequivalent) complex irreducible representations of degree coprime to $p$ ($p$ a prime) of a finite group $G$ and those of the subgroup $N$, the normalizer of…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs of this fact. It turns…
This article explains the similar appearance of two polynomial identities involving Dickson polynomials in char. 2, one found by Abhyankar, Cohen, and Zieve, and the other found by the author.
The two partition functions $p_\omega(n)$ and $p_\nu(n)$ were introduced by Andrews, Dixit and Yee, which are related to the third order mock theta functions $\omega(q)$ and $\nu(q)$, respectively. Recently, Andrews and Yee analytically…
We give bijective proofs of Monk's rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double…
We present conjectures giving formulas for the Macdonald polynomials of type B, C, D which are indexed by a multiple of the first fundamental weight. The transition matrices between two different types are explicitly given.
The aim of this paper is to give an elementary proof of certain identities on binomials and state an answer to Remark 8.2 in Takahiro Hayata, Harutaka Koseki, and Takayuki Oda, Matrix coefficients of the middle discrete series of SU(2,2),…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam and Williams. We also…
In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…