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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We prove a fairly general convergence criterion for sequences satisfying a linear recurrence (defined by an infinite triangular matrix). We prove that every sequence of positive numbers satisfying a nearly convex linear recurrence with finite retardation and active predecessors converges to a positive limit. Informally, near convexity means the coefficients axe nonnegative and the sum of coefficients in each equation is approximately 1; finite retardation means low order terms have little weight; and active predecessors mean that the immediate predecessor carries a weight greater than a fixed positive constant. We present an application to the asymptotic number of not necessarily maximal chains in the partition lattice. The coefficients of the corresponding recurrence are the Stirling numbers of the second kind. AMS 1980 classification numbers: 40A05, 11B37, 05A15, 06C10, 11B73

A CONVERGENCE CRITERION FOR RECURRENT SEQUENCES WITH APPLICATION TO THE PARTITION LATTICE