Publication

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller
2022
Journal paper
Abstract

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite dimensional. The Fourier non-uniqueness set thus obtained is a discrete subset of the union of all spheres root mS(n-1) for integers m >= 0 and, as m -> infinity, there are similar to c(K)m(n-1) many points on the m-th sphere for some explicit constant c(K), proportional to the square root of the discriminant of K. This contrasts a recent Fourier uniqueness result by Stoller (2021) Using a different construction involving the codifferent of K, we prove an analogue for discrete subsets of ellipsoids. In special cases, these sets also lie on spheres with more densely spaced radii, but with fewer points on each. We also study a related question about existence of Fourier interpolation formulas with nodes "root Lambda" for general lattices Lambda subset of R-n. Using results about lattices in Lie groups of higher rank we prove that if n >= 2 and a certain group Gamma(Lambda) >= PSL2.(R)(n) is discrete, then such interpolation formulas cannot exist. Motivated by these more general considerations, we revisit the case of one radial variable and prove, for all n >= 5 and all real lambda >= 2, Fourier interpolation results for sequences of spheres root 2m/lambda Sn-1, where m ranges over any fixed cofinite set of non-negative integers. The proof relies on a series of Poincare type for Hecke groups of infinite covolume and is similar to the one in Stoller (2021).

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related concepts (51)
Discrete Fourier transform
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.
Fourier transform
In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.
Interpolation
In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.
Show more
Related publications (58)

Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS

Laurent Villard, Stephan Brunner, Alberto Bottino, Moahan Murugappan

We introduce and derive the Fourier -enhanced 3D electrostatic field solver of the gyrokinetic full -f PIC code PICLS. The solver makes use of a Fourier representation in one periodic direction of the domain to make the solving of the system easily paralle ...
Elsevier2024

Moments of the number of points in a bounded set for number field lattices

Maryna Viazovska, Nihar Prakash Gargava, Vlad Serban

We examine the moments of the number of lattice points in a fixed ball of volume VV for lattices in Euclidean space which are modules over the ring of integers of a number field KK. In particular, denoting by ωKω_K the number of roots of unity in KK, we ...
arXiv2023

An optimal preconditioned FFT-accelerated finite element solver for homogenization

Till Junge, Ali Falsafi, Martin Ladecký

We generalize and provide a linear algebra-based perspective on a finite element (FE) ho-mogenization scheme, pioneered by Schneider et al. (2017)[1] and Leuschner and Fritzen (2018)[2]. The efficiency of the scheme is based on a preconditioned, well-scale ...
ELSEVIER SCIENCE INC2023
Show more
Related MOOCs (32)
Digital Signal Processing I
Basic signal processing concepts, Fourier analysis and filters. This module can be used as a starting point or a basic refresher in elementary DSP
Digital Signal Processing II
Adaptive signal processing, A/D and D/A. This module provides the basic tools for adaptive filtering and a solid mathematical framework for sampling and quantization
Digital Signal Processing III
Advanced topics: this module covers real-time audio processing (with examples on a hardware board), image processing and communication system design.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.