A CONVERGENCE CRITERION FOR RECURRENT SEQUENCES WITH APPLICATION TO THE PARTITION LATTICE
DOI10.1524/ANLY.1992.12.12.109zbMATH Open0755.40002OpenAlexW1981320681MaRDI QIDQ3993908FDOQ3993908
Authors: László Babai, Tamás Lengyel 
Publication date: 13 August 1992
Published in: Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1524/anly.1992.12.12.109
Recommendations
Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Convergence and divergence of series and sequences (40A05) Recurrences (11B37) Semimodular lattices, geometric lattices (06C10)
Cited In (11)
- Title not available (Why is that?)
- Enumeration of sequences constrained by the ratio of consecutive parts
- Asymptotic behavior of Volterra difference equations
- Combinatorial structures and structures for classification
- On the shortest sequences of elementary transformations in the partition lattice
- On some 2-adic properties of a recurrence involving Stirling numbers
- Polydiagonal compactification of configuration spaces
- Existence of positive solutions of systems of Volterra nonlinear difference equations
- On a recurrence involving Stirling numbers
- Slow Beatty Sequences, Devious Convergence, and Partitional Divergence
- Solution formulas for linear difference equations with applications to continued fractions
This page was built for publication: A CONVERGENCE CRITERION FOR RECURRENT SEQUENCES WITH APPLICATION TO THE PARTITION LATTICE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993908)
