Paperfolding infinite products and the gamma function
Jean-Paul Allouche

TL;DR
This paper explores infinite products derived from Thue-Morse and paperfolding sequences, providing new closed-form formulas involving gamma and trigonometric functions, and generalizing previous results in the field.
Contribution
It introduces new closed-form expressions for infinite products related to paperfolding sequences, involving gamma functions and general rational function replacements.
Findings
Closed form for product B involving gamma at 1/4
General results for products with rational function terms
Some formulas involve only trigonometric functions
Abstract
Taking the product of (2n+1)/(2n+2) raised to the power +1 or -1 according to the n-th term of the Thue-Morse sequence gives rise to an infinite product P while replacing (2n+1)/(2n+2) with (2n)/(2n+1) yields an infinite product Q, where P = (1/2)(4/3)(6/5)(7/8)(10/9)... and Q = (2/3)(5/4)(7/6)(8/9)(11/10)... Though it is known that P = 2^{-1/2}, nothing is known about Q. Looking at the corresponding question when the Thue-Morse sequence is replaced by the regular paperfolding sequence, we obtain two infinite products A and B, where A = (1/2)(3/4)(6/5)(7/8)(9/10)... and B = (2/3)(4/5)(7/6)(8/9)(10/11)... Here nothing is known for A, but we give a closed form for B that involves the value of the gamma function at 1/4. We then prove general results where (2n+1)/(2n+2) or (2n)/(2n+1) are replaced by specific rational functions. The corresponding infinite products have a closed form…
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 · Algorithms and Data Compression · Coding theory and cryptography
