Patterns in numbers and infinite sums and products
Yining Hu
TL;DR
This paper introduces a general method for deriving infinite sums of products involving functions that count numerical patterns, advancing the understanding of infinite series related to pattern enumeration.
Contribution
It presents a novel approach to compute infinite sums of products based on pattern-counting functions in numbers, expanding analytical tools in this area.
Findings
Developed a new method for infinite sums involving pattern-counting functions
Applied the method to various numerical pattern problems
Provided insights into the structure of infinite sums and products
Abstract
In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
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.
Taxonomy
Topicssemigroups and automata theory · Mathematical Dynamics and Fractals · Computability, Logic, AI Algorithms