7 citations · 12 across the 19 of their papers we have counts for
23 papers
Improved dimension bounds for Falconer's distance problem in the plane
Alex Iosevich, Alexia Yavicoli
Let be analytic with . We prove for an absolute, non-explicit constant , and \[ \dim_{\mathrm H}…
Spectral synthesis with the complexity parameter in
Alex Iosevich, Zhihe Li, Ke Yu
We study asymptotic spectral synthesis on using the Fourier ratio, the quotient of the counting-measure and norms of the unitary Fourier transform…
Edge complexity of weighted graphs: involutory symmetries and NP-hardness
Vishal Gupta, Alex Iosevich
The edge complexity of a weighted graph is the smallest ratio of the Fourier and norms of its adjacency matrix over all vertex labelings. We study the difficulty…
Restricted isometry of sampled Fourier and Hadamard matrices via entropic descent
W. Burstein, A. Iosevich, B. Krause
In this second paper on descent methods as proof mechanisms in harmonic analysis (the first treated Bourgain's selection theorem), entropic mirror descent gives an improved…
Bourgain's Lambda(p) selection theorem: a greedy proof with polynomial failure bounds
Will Burstein, Alex Iosevich, Ben Krause
We give a self-contained proof of Bourgain's finite selection theorem with an explicit probability bound. For every and , given pairwise orthogonal function…
Minkowski sums with convex curves without pointwise Fourier decay
Alex Iosevich, Zhangze Li, Eyvindur Palsson +2
Let be a compact convex graph and define \[ T(Γ) = \inf \left\{ t: \dim_{\mathrm H}(E)>t \Longrightarrow |E+Γ|>0 \text{ for every compact }E\subset\mathbb R^2…