Related papers: How many Fourier coefficients are needed?
We compute the one-level density for the family of cubic Dirichlet $L$-functions when the support of the Fourier transform of a test function is in $(-1,1)$. We also establish the Ratios conjecture prediction for the one-level density for…
We present an algorithm producing all rational functions $f$ with prescribed $n+1$ Taylor coefficients at the origin and such that $\|f\|_\infty\le 1$ and $\deg f\le k$ for every fixed $k\ge n$. The case where $k<n$ is also discussed.
Fourier series with power series coefficients for the normal and distance to a point from an ellipse are derived. These expressions are the first of their kind and opens up a range of analysis and computational possibilities.
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…
The main aim of the paper is to present a general version of the Fourier Tauberian theorem for monotone functions. This result, together with Berezin's inequality, allows us to obtain a refined version the Li-Yau estimate for the counting…
Let $(X,d)$ be a compact metric space, and let an iterated function system (IFS) be given on $X$, i.e., a finite set of continuous maps $\sigma_{i}$: $ X\to X$, $i=0,1,..., N-1$. The maps $\sigma_{i}$ transform the measures $\mu $ on $X$…
Fourier series are considered on the one-dimensional torus for the space of periodic distributions that are the distributional derivative of a continuous function. This space of distributions is denoted $\alext$ and is a Banach space under…
We discuss the problem of bounding the Fourier transforms of stationary measures of iterated function systems (IFSs) and how the pseudo-randomness of the IFS either due to arithmetic, algebraic or geometric reasons is reflected in the…
In this paper, we have proved four theorems on the degree of approximation of continuous functions by matrix means of their Fourier series which is expressed in terms of the modulus of continuity and a non-negative mediate function.
Let X be a projective curve defined over Q and t a non-constant Q-rational function on X of degree at least 2. For every integer n pick a point P_n on X such that t(P_n)=n. A result of Dvornicich and Zannier implies that, for large N, among…
Analogues of multi-paramter multiplier operators on R^d are defined on the torus T^d. It is shown that these operators satisfy the classical Coifman-Meyer theorem. In addition, L log L and L (log L)^n end-point estimates are proved.
A Lissajous knot is one that can be parameterized by a single cosine function in each coordinate. Lissajous knots are highly symmetric, and for this reason, not all knots are Lissajous. We prove several theorems which allow us to place…
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
It is known that if $p$ is a sufficiently large prime then for every function $f:\mathbb{Z}_p\to [0,1]$ there exists a continuous function on the circle $f':\mathbb{T}\to [0,1]$ such that the averages of $f$ and $f'$ across any prescribed…
In order to quantitatively study the accuracy of the unconditionally stable coarsening algorithms, we calculate the Fourier space multi step error on the order parameter field by explicitly distinguishing the analytic time $\tau$ and the…
The aim of this paper is twofold. Firstly, we give easy-to-handle criteria to determine whether a given family of subsets of a vector space is a neighbourhood basis of the origin for a complete vector topology. Then, we apply these criteria…
Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…