3 citations · 5 across the 7 of their papers we have counts for
7 papers
An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
Thomas Baruchel
We present a new content-agnostic algorithm for iterating over all permutations of a sequence. The algorithm leverages elementary~ operations on recursive lists. As a result,…
A non-symmetric divide-and-conquer recursive formula for the convolution of polynomials and power series
Thomas Baruchel
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 co…
Properties of the cumulated deficient binary digit sum
Thomas Baruchel
The sequence A268289 from the On-Line Encyclopedia of Integer Sequences, namely the cumulated differences between the number of digits 1 and the number of digits 0 in the binary ex…
Flattening Karatsuba's recursion tree into a single summation
Thomas Baruchel
The recursion tree resulting from Karatsuba's formula is built here by using an interleaved splitting scheme rather than the traditional left/right one. This allows an easier acces…
Some conjectural continued fractions
Thomas Baruchel
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
On error sums formed by rational approximations with split denominators
Thomas Baruchel, Carsten Elsner
In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_mα- \frac{a_m}{c_m}\,\Big) \,,\] where is a real number, , , are i…
Variations on an error sum function for the convergents of some powers of
Jean-Paul Allouche, Thomas Baruchel
Several years ago the second author playing with different "recognizers of real constants", e.g., the LLL algorithm, the Plouffe inverter, etc. found empirically the following form…