2000 character limit reached
On the distribution of rank statistic for strongly concave compositions
Published 30 Oct 2018 in math.NT and math.CO | (1810.12493v2)
Abstract: A strongly concave composition of $n$ is an integer partition with strictly decreasing and increasing parts. In this paper we give a uniform asymptotic formula for the rank statistic of a strongly concave composition introduced by Andrews, Rhoades and Zwegers ['Modularity of the concave composition generating function', Algebra & Number Theory 7 (2013), no. 9, 2103--2139].
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.