English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The generating function for $p_N(n)$, the number of partitions of $n$ into atmost $N$ parts, may be written as a product of $N$ factors. In part I, westudied the behavior of coefficients in the partial fraction decomposition ofthis product as $N \to \infty$ by applying the saddle-point method to get theasymptotics of the main terms. In this second part we bound the error terms.This involves estimating products of sines and further saddle-point arguments.The saddle-points needed are associated to zeros of the analytically continueddilogarithm.

Asymptotics for the partial fractions of the restricted partition generating function II