2000 character limit reached
q-Congruences, with applications to supercongruences and the cyclic sieving phenomenon
Published 3 May 2018 in math.NT and math.CO | (1805.01254v2)
Abstract: We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Ap\'{e}ry numbers, by means of a general criterion involving higher derivatives at roots of unity. Our methods lead us to discover new examples of the cyclic sieving phenomenon, involving the $q$-Lucas numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.