A non-symmetric divide-and-conquer recursive formula for the convolution\n of polynomials and power series

2019/12/01 by Thomas Baruchel, Baruchel, Thomas · 2 voices
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Computational Physics and Python Applications #Numerical Methods and Algorithms #math.NT

paper · pdf · doi:10.48550/arxiv.1912.00452

openalex publication_date 2019/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Some changes in a recent convolution formula are performed here in order to\nclean it up by using more conventional notations and by making use of more\nreferrenced and documented components (namely Sierpi 'nski's polynomials, the\nThue-Morse sequence, the binomial modulo~2 transform and its inverse). Several\nvariants are published here, by reading afterwards summed coefficients in\nanother order; the last formula is then turned back from a summation to a new\ndivide-and-conquer recursive formula.\n

Discussions

• A non-symmetric divide-and-conquer recursive formula for the convolution of polynomials and power series [lobsters, 4 points, 0 comments]
• A non-symmetric divide-and-conquer recursive formula for the convolution [hn, 1 points, 0 comments]

Related

• On convolution powers of 1/x
• Convolutions for Stirling numbers, Lah numbers, and binomial coefficients
• Dirichlet Series Under Standard Convolutions: Variations on Ramanujan's Identity for Odd Zeta Values
• Volterra-type convolution of classical polynomials
• Convolutions of second order sequences: A direct approach