Asymptotics for rank partition functions

Simple item page
dc.creatorBringmann, Kathrin
dc.date2007-08-05
dc.date.accessioned2026-07-07T08:22:17Z
dc.date.available2026-07-07T08:22:17Z
dc.descriptionIn this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.
dc.description19 pages Transactions of the AMS, accepted for publication
dc.identifierhttps://arxiv.org/abs/0708.0691
dc.identifierhttp://arxiv.org/abs/0708.0691
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135601
dc.subjectNumber Theory
dc.subject05A17, 11P82
dc.titleAsymptotics for rank partition functions
dc.typetext

Files

Collections

arXiv