Papers › q-Binomial Identities Finder
q-Binomial Identities Finder
Hao Zhong, Leqi Zhao
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper presents a symbolic computation method for automatically transforming q-hypergeometric identities to q-binomial identities. Through this method, many previously proven q-binomial identities, including q-Saalsch\"utz's formula and q-Suranyi's formula, are re-fund, and numerous new ones are discovered. Moreover, the generation of the identities is accompanied by the corresponding proofs. During the transformation process, different ranges of variable values and various combinations of q-Pochhammer symbols yield different identities. The algorithm maps variable constraints to positive elements in an ordered vector space and employs a backtracking method to provide the feasible variable constraints and q-binomial coefficient combinations for each step.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections