A generalized Mobius transform and arithmetic Fourier transforms

A general approach to arithmetic Fourier transforms (AFT) is developed. The implementation is based on the concept of killer polynomials and the solution of an arithmetic deconvolution problem pertaining to a generalized Mobius transform. This results in an extension of the Bruns (1903) procedure, valid for all prime numbers, and in an AFT that extracts directly the sine coefficients from the Fourier series.<
>