Charles B. Mei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Charles B. Mei has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Daniel K. Du
Center for Combinatorics LPMC-TJKLC Nankai University 300071 Tianjin P. R. China
1 shared publication - Daniel K. Du
Center for Applied Mathematics Tianjin University 300072 Tianjin P. R. China
1 shared publication - Melissa Y. F. Miao
Center for Combinatorics LPMC-TJKLC Nankai University 300071 Tianjin P.R. China
1 shared publication - Qing-Hu Hou
Center for Applied Mathematics, Tianjin University, Tianjin, P.R. China
1 shared publication - Teresa Xueshan Li
Southwest University
1 shared publication - William Y. C. Chen
Center for Combinatorics LPMC-TJKLC Nankai University 300071 Tianjin P. R. China
1 shared publication
Latest Publications
- Open Access
The Method of Multiple Combinatorial Telescoping
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
Open AccessThe Method of Multiple Combinatorial Telescoping
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
- Open Access
Eulerian pairs on Fibonacci words
Recently, Sagan and Savage introduced the notion of Eulerian pairs. In this note, we find Eulerian pairs on Fibonacci words based on Foata's first transformation or Han's bijection and a map in the spirit of a bijection of Steingr\'{\i}msson.
Open AccessEulerian pairs on Fibonacci words
Recently, Sagan and Savage introduced the notion of Eulerian pairs. In this note, we find Eulerian pairs on Fibonacci words based on Foata's first transformation or Han's bijection and a map in the spirit of a bijection of Steingr\'{\i}msson.
- Open Access
Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the combinatorial objects corresponding to a sum of positive terms, we establish bijections that lead a telescoping relation. We illustrate this idea by giving a combinatorial telescoping relation for a classical identity of MacMahon. Recently, Andrews posed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials which was derived based on a recurrence relation. We find a combinatorial classification of certain triples of partitions and a sequence of bijections. By the method of cancelation, we see that there exists an involution for a recurrence relation that implies the identity of Andrews.
Open AccessCombinatorial Telescoping for an Identity of Andrews on Parity in Partitions
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the combinatorial objects corresponding to a sum of positive terms, we establish bijections that lead a telescoping relation. We illustrate this idea by giving a combinatorial telescoping relation for a classical identity of MacMahon. Recently, Andrews posed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials which was derived based on a recurrence relation. We find a combinatorial classification of certain triples of partitions and a sequence of bijections. By the method of cancelation, we see that there exists an involution for a recurrence relation that implies the identity of Andrews.