%0 PDF
%T Proof of the Alder-Andrews Conjecture.
%A Lemke Oliver, Robert J.; Alfes, Claudia.; Jameson, Marie.
%D 2017-07-07T07:52:52.729-04:00
%8 2017-07-07
%I Tufts University. Tisch Library.
%R http://localhost/files/7w62fm68j
%X Motivated by classical identities of Euler, Schur, and Rogers and Ramanujan, Alder investigated qd(n) and Qd(n), the number of partitions of n into d-distinct parts and into parts which are ±1(mod d + 3), respectively. He conjectured that qd(n) ≥ Qd(n) Andrews and Yee proved the conjecture for d = 2s −1 and also for d ≥ 32. We complete the proof of Andrews's refinement of Alder's conjecture by determining effective asymptotic estimates for these partition functions (correcting and refining earlier work of Meinardus), thereby reducing the conjecture to a finite computation. (c) 2010 American Mathematical Society.
%[ 2018-10-09
%9 Text
%~ Tufts Digital Library
%W Institution