Asymptotic Formulae for Mixed Congruence Stacks
Number Theory
2017-11-01 v2
Abstract
Much like the important work of Hardy and Ramanujan proving the asymptotic formula for the partition function, Auluck and Wright gave similar formulas for unimodal sequences. Following the circle method of Wright, we provide the asymptotic expansion for unimodal sequences on a two-parameter family of mixed congruence relations, with parts on one side up to the peak satisfying r (mod m) and parts on the other side -r (mod m). Techniques used in the proofs include Wright's circle method, modular transformations, and bounding of complex integrals.
Cite
@article{arxiv.1705.03904,
title = {Asymptotic Formulae for Mixed Congruence Stacks},
author = {Richard Frnka},
journal= {arXiv preprint arXiv:1705.03904},
year = {2017}
}
Comments
19 pages, 2 figures, results from dissertation work