2000 character limit reached
Composition-theoretic series in partition theory
Published 12 Sep 2022 in math.NT and math.CO | (2209.06745v2)
Abstract: We use sums over integer compositions analogous to generating functions in partition theory, to express certain partition enumeration functions as sums over compositions into parts that are $k$-gonal numbers; our proofs employ Ramanujan's theta functions. We explore applications to lacunary $q$-series, and to a new class of composition-theoretic Dirichlet series.
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.