Related papers: How many Fourier coefficients are needed?

Items in a test are often used as a basis for making decisions and such tests are therefore required to have good psychometric properties, like unidimensionality. In many cases the sum score is used in combination with a threshold to decide…

Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…

Let $f$ be an entire almost periodic function with zeros in a horizontal strip of finite width; for example, any exponential polynomial with purely imaginary exponents is such a function. Let $\mu$ be the measure on the set of zeros of $f$…

We introduce a small change in the definition of the Fourier series so that we can guarantee the coincidence with the given function at the endpoints of the interval even if the function does not assume the same value at the endpoints. This…

We prove a Wiener-type theorem for arcs in the unit circle which concerns express the measure of an arc in the unit circle via the measure's Fourier coefficients. Then we use it to give the Fourier series of the Cantor and to compute the…

We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…

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]$…

We investigate certain families $X^\hbar$, $0<\hbar \ll 1$, of Gaussian random smooth functions on the $m$-dimensional torus $\mathbb{T}^m_\hbar:=\mathbb{R}^m/(\hbar^{-1}\mathbb{Z} )^m$. We show tha,t for any cube $B\subset \mathbb{R}^m$ of…

Taking the Fourier integral theorem as our starting point, in this paper we focus on natural Monte Carlo and fully nonparametric estimators of multivariate distributions and conditional distribution functions. We do this without the need…

For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…

We show that in critical loop models, torus 1-point functions can be expressed in terms of sphere 4-point functions at a different central charge. Unlike in the Moore--Seiberg formalism, crossing symmetry on the sphere therefore implies…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus,…

abridged] A method to rapidly estimate the Fourier power spectrum of a point distribution is presented. This method relies on a Taylor expansion of the trigonometric functions. It yields the Fourier modes from a number of FFTs, which is…

In many applications data are measured or defined on a spherical manifold; spherical harmonic transforms are then required to access the frequency content of the data. We derive algorithms to perform forward and inverse spin spherical…

A subfactor is an inclusion $N \subset M$ of von Neumann algebras with trivial centers. The simplest example comes from the fixed points of a group action $M^G \subset M$, and subfactors can be thought of as fixed points of more general…

The possible values of the nth Fourier coefficients a(n) of some cusp forms f(z) of weight k => 12 are studied in this article. In particular, the values of the tau function are investigated in some details, and proved that tau(p) =! 0 for…

The Fourier transform of the indicator function of arbitrary polygons and polyhedra is computed for complex wavevectors. Using the divergence theorem and Stokes' theorem, closed expressions are obtained. Apparent singularities, all…