Related papers: Periodic Fourier representation of Boolean functio…
A quantum single-error-correcting scheme can be derived from a one-way entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The main issue to be concerned with in the theory of such an…
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…
If $f$ is a nonzero Bohr almost periodic function on $\mathbb R$ with a bounded spectrum we prove there exist $C_f > 0$ and integer $n > 0$ such that for every $u > 0$ the mean measure of the set $\{\, x \, : \, |f(x)| < u \, \}$ is less…
In an effort to extend classical Fourier theory, Hedenmalm and Montes-Rodr\'{\i}guez (2011) found that the function system \[ e_m(x)=e^{i\pi mx},\quad e_n^\dagger(x)=e_n(-1/x)=e^{-i\pi n/x} \] is weak-star complete in…
We provide (partial) reconstruction formulas and discrete Fourier transforms for wave functions in standard Fock-Bargmann (holomorphic) phase-number representation from a finite number $N$ of phase samples $\{\theta_k=2\pi…
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…
Optimization of real-world black-box functions defined over purely categorical variables is an active area of research. In particular, optimization and design of biological sequences with specific functional or structural properties have a…
This work brings together two powerful concepts in Gaussian processes: the variational approach to sparse approximation and the spectral representation of Gaussian processes. This gives rise to an approximation that inherits the benefits of…
Timing noise in pulsars is often modelled with a Fourier-basis Gaussian process that follows a power law with periodic boundary conditions on the observation time, $T_\mathrm{span}$. However the actual noise processes can extend well below…
In this paper we establish Lebesgue-type inequalities for $2\pi$-periodic functions $f$, which are defined by generalized Poisson integrals of the functions $\varphi$ from $L_{p}$, $1\leq p< \infty$. In these inequalities uniform norms of…
Gaussian process modulated Poisson processes provide a flexible framework for modelling spatiotemporal point patterns. So far this had been restricted to one dimension, binning to a pre-determined grid, or small data sets of up to a few…
An aperiodic (low frequency) spectrum may originate from the error term in the mean value of an arithmetical function such as M\"obius function or Mangoldt function, which are coding sequences for prime numbers. In the discrete Fourier…
We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
We provide a large class of functions $f$ that are bell-shaped: the $n$-th derivative of $f$ changes its sign exactly $n$ times. This class is described by means of Stieltjes-type representation of the logarithm of the Fourier transform of…
We develop a Fourier analysis for a generalization of the class of periodic functions, often referred to as $(\theta, T)$-periodic functions, and prove several properties and inequalities related to the Fourier transform, including a type…
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…