The Method of Multiple Combinatorial Telescoping
classification
🧮 math.CO
math.NT
keywords
combinatorialmethodmultipletelescopingandrewscasedemonstrategeneralize
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.