6 papers
Elliptic curves, Fourier ratio, and sampling complexity
W. Burstein, A. Iosevich, A. Sant
We study the normalized Frobenius trace associated with the Legendre family of elliptic curves over from the point of view of Fourier complexity. If \[ f(t)=\frac{a_p…
Arithmetic functions and learning theory
W. Burstein, A. Iosevich, A. Sant
We establish a connection between analytic number theory and computational learning theory by showing that the Möbius function belongs to a class of functions that is statisticall…
The Fourier Ratio: A Unifying Measure of Complexity for Recovery, Localization, and Learning
Will Burstein, Alex Iosevich, Hari Sarang Nathan
We introduce a generalized Fourier ratio, the \(\ell^1/\ell^2\) norm ratio of coefficients in an \emph{arbitrary} orthonormal system, as a single, basis-invariant measure of \emph{…
The Fourier Ratio and complexity of signals
K. Aldaleh, W. Burstein, G. Garza +12
We study the Fourier ratio of a signal , \[ \mathrm{FR}(f)\ :=\ \sqrt{N}\,\frac{\|\widehat f\|_{L^1(μ)}}{\|\widehat f\|_{L^2(μ)}} \ =\ \frac{\|\widehat…
Fourier minimization and imputation of time series
Will Burstein, Alex Iosevich, Azita Mayeli +1
One of the most common procedures in modern data analytics is filling in missing values in times series. For a variety of reasons, the data provided by clients to obtain a forecast…
Style Bounds in Orlicz Spaces Close to
Will Burstein
Let be mutually orthogonal functions on a probability space such that for all . Let . Let for…