Related papers: Fun With Fourier Series
Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…
As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…
Fractional calculus is the calculus of differentiation and integration of non-integer orders. In a recently paper (Annals of Physics 323 (2008) 2756-2778), the Fundamental Theorem of Fractional Calculus is highlighted. Based on this…
In terms of the difference operators, we establish several curious transformation and summation formulas for basic hypergeometric series. When the parameters are specified, they produce $q$-analogues of Ramanujan's three series for 1/$\pi$…
The purpose of this note is to prove estimates for $$ \left| \sum_{k=1}^{n} \mbox{sign} \left( \cos \left( \frac{2\pi a}{n} k \right) \right) \mbox{sign} \left( \cos \left( \frac{2\pi b}{n} k \right) \right)\right|,$$ when $n$ is prime and…
Let $f\in L_{2\pi}$ be a real-valued even function with its Fourier series $ \frac{a_{0}}{2}+\sum_{n=1}^{\infty}a_{n}\cos nx,$ and let $S_{n}(f,x), n\geq 1,$ be the $n$-th partial sum of the Fourier series. It is well-known that if the…
In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…
There is not much that can be said for all $x$ and for all $n$ about the sum \[ \sum_{k=1}^n \frac{1}{|\sin k\pi x|}. \] However, for this and similar sums, series, and products, we can establish results for almost all $x$ using the tools…
We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…
Liu and Liu in 2007 introduced the Fourier - Hermite transform $\sum a_{n}\lambda_{n}^{R}\psi_{n}(t)$ which is a random Fourier - Hermite series with random variables $\lambda_{n}^{R}$ choosen randomly from the unit circle of $\mathbb{C}$,…
We prove an explicit formula for the Fourier transform of $f(u(t))$, given the Fourier transform of $f(t)$, assuming $f\in L^2(-\infty,\infty)$ and $u$ sufficiently well behaved. We illustrate its usefulness by calculating the Fourier…
An efficient approach to handle localized states by using spectral methods (SM) in one and three dimensions is presented. The method consists of transformation of the infinite domain to the bounded domain in $(0, \pi)$ and using the Fourier…
We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
Dirichlet's $L$-functions are natural extensions of the Riemann zeta function. In this paper we first give a brief survey of Ap\'ery-like series for some special values of the zeta function and certain $L$-functions. Then, we establish two…
We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $\pi(n)$, the prime-counting function. We also obtain that $\pi(n) \sim n a_n$ and we estimate…
The Bessel function of the first kind $J_{N}\left(kx\right)$ is expanded in a Fourier-Legendre series, as is the modified Bessel functions of the first kind $I_{N}\left(kx\right)$. The purpose of these expansions in Legendre polynomials was…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
About 40 years ago Jonathan and Peter Borwein discovered the series identity $$ \sum_{n=0}^\infty \frac{(-1)^n(6n)!}{(3n)!(n!)^3} \frac{(A+nB)}{C^{n+1/2}} = \frac{1}{12\pi} $$ where \begin{align*} A&=1657145277365+212175710912\sqrt{61},\cr…
Let $b(n)$ be the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ consists of distinct odd parts, and $\pi_2$ and $\pi_3$ consist of parts divisible by $4$. Utilizing modular forms, Lin obtained the generating…