Picturesque convolution-like recurrences and partial sums' generation
Ignas Gasparavi\v{c}ius, Andrius Grigutis, Juozas Petkelis

TL;DR
This paper introduces methods to generate new sequences related to a known sequence using convolution-like recurrences, exploring their properties, limits, and connections to famous sequences like the partial sums of the Riemann zeta function.
Contribution
It presents novel techniques for constructing sequences via convolution-like recurrences and analyzes their asymptotic behavior and geometric patterns.
Findings
Sequences can be related through convolution-like recurrences.
Limit behavior of sequences depends on initial terms and the known sequence.
Examples include partial sums of the Riemann zeta function.
Abstract
Let be the known sequence of numbers such that . In this work, we develop methods to find another sequence that is related to as follows: , , . We show the connection of with and provide varied examples of finding the sequence when is given. We demonstrate that the sequences may exhibit pretty patterns in the plane or space. Also, we show that the properly chosen sequence may define as some famous sequences, such as the partial sums of the Riemann zeta function, etc.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
