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

arXiv1912.00452MaRDI QIDQ6330201FDOQ6330201

Publication date: 1 December 2019

Abstract: Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi'nski's polynomials, the Thue-Morse sequence, the binomial modulo~2 transform and its inverse). Several variants are published here, by reading afterwards summed coefficients in another order; the last formula is then turned back from a summation to a new divide-and-conquer recursive formula.

This page was built for publication: A non-symmetric divide-and-conquer recursive formula for the convolution of polynomials and power series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330201)