Page 1 Next

Displaying 1 – 20 of 103

Showing per page

Computing discrete convolutions with verified accuracy via Banach algebras and the FFT

Jean-Philippe Lessard (2018)

Applications of Mathematics

We introduce a method to compute rigorous component-wise enclosures of discrete convolutions using the fast Fourier transform, the properties of Banach algebras, and interval arithmetic. The purpose of this new approach is to improve the implementation and the applicability of computer-assisted proofs performed in weighed 1 Banach algebras of Fourier/Chebyshev sequences, whose norms are known to be numerically unstable. We introduce some application examples, in particular a rigorous aposteriori...

Convergence of series of dilated functions and spectral norms of GCD matrices

Christoph Aistleitner, István Berkes, Kristian Seip, Michel Weber (2015)

Acta Arithmetica

We establish a connection between the L² norm of sums of dilated functions whose jth Fourier coefficients are ( j - α ) for some α ∈ (1/2,1), and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in L² and for the almost everywhere convergence of series of dilated functions.

Double sine series with nonnegative coefficients and Lipschitz classes

Vanda Fülöp (2006)

Colloquium Mathematicae

Denote by f s s ( x , y ) the sum of a double sine series with nonnegative coefficients. We present necessary and sufficient coefficient conditions in order that f s s belongs to the two-dimensional multiplicative Lipschitz class Lip(α,β) for some 0 < α ≤ 1 and 0 < β ≤ 1. Our theorems are extensions of the corresponding theorems by Boas for single sine series.

Fourier analysis, linear programming, and densities of distance avoiding sets in n

Fernando Mário de Oliveira Filho, Frank Vallentin (2010)

Journal of the European Mathematical Society

We derive new upper bounds for the densities of measurable sets in n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new upper bounds for measurable sets which avoid the unit distance in dimensions 2 , , 24 . This gives new lower bounds for the measurable chromatic number in dimensions 3 , , 24 . We apply it to get a short proof of a variant of a recent result of Bukh which in turn generalizes theorems of Furstenberg,...

Currently displaying 1 – 20 of 103

Page 1 Next