Thomas Baruchel

1. Flattening Karatsuba’s Recursion Tree into a Single Summation
   2019/02/24 by Thomas Baruchel · 2 voices
   Computer Science · Mathematics · #Advanced Mathematical Identities #Mathematical functions and polynomials #Polynomial and algebraic computation #cs.DM #math.NT
2. 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
3. Variations on an error sum function for the convergents of some powers of e
   2014/08/10 by Jean‐Paul Allouche, Thomas Baruchel, Allouche, Jean-Paul +1 · 1 citation
   Computer Science · Mathematics · #11A55 #11B75 #11B83 #11J70 #Coding theory and cryptography #FOS: Mathematics #Mathematical functions and polynomials #Number Theory (math.NT) #Numerical Methods and Algorithms
4. On error sums formed by rational approximations with split denominators
   2016/02/20 by Thomas Baruchel, Baruchel, Thomas, Carsten Elsner +1 · 1 citation
   Mathematics · #Analytic Number Theory Research #FOS: Mathematics #Mathematical Approximation and Integration #Mathematical functions and polynomials #Number Theory (math.NT)
5. Properties of the cumulated deficient binary digit sum
   2019/08/06 by Thomas Baruchel, Baruchel, Thomas · 1 citation
   Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT) #semigroups and automata theory