2000 character limit reached
A method for determining the mod-$2^k$ behaviour of recursive sequences, with applications to subgroup counting
Published 11 Jul 2011 in math.CO and math.GR | (1107.2015v2)
Abstract: We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-Catalan numbers, and to subgroup counting functions associated with Hecke groups and their lifts. This leads to numerous new results, including many extensions of known results to higher powers of 2.
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.