Let $E\subset\mathbb R^2$ be analytic with $t=\dim_{\mathrm H}E>1$. We prove $\dim_{\mathrm H}\Delta E\ge 4/5+\eta_0$ for an absolute, non-explicit constant $\eta_0>0$, and \[ \dim_{\mathrm H}\Delta E\ge \frac{t^2-2t+5}{2t^2-7t+10} \quad\text{for }1<t\le\frac{11-\sqrt{41}}{4}, \] which reaches $7/8$ at the right endpoi...
In this second paper on descent methods as proof mechanisms in harmonic analysis (the first treated Bourgain's $\Lambda(p)$ selection theorem), entropic mirror descent gives an improved restricted isometry bound, improving sampling and recovery bounds in the Fourier Ratio program. Let $H$ be a complex $n\times n$ matri...
Let $\Gamma\subset\mathbb R^2$ be a compact convex graph and define \[ T(\Gamma) = \inf \left\{ t: \dim_{\mathrm H}(E)>t \Longrightarrow |E+\Gamma|>0 \text{ for every compact }E\subset\mathbb R^2 \right\}. \] For a graph over an interval of positive length the smallest possible value is $T(\Gamma)=1$. We ask whether th...
A. Iosevich, Zhang Li, E. Palsson et al.· 0 citations
The edge complexity of a weighted graph is the smallest ratio of the Fourier $\ell^1$ and $\ell^2$ norms of its adjacency matrix over all vertex labelings. We study the difficulty of finding this minimum by relating it to a graph symmetry. Adding a universal vertex with sufficiently large incident weight produces an ex...
Gupta and Iosevich introduced the edge complexity of a graph as the minimum Fourier ratio of its adjacency matrix over all vertex labelings and bounded it below by graph energy divided by the square root of twice the number of edges. We characterize equality for a fixed labeling: the Fourier transform of the adjacency...
Vishal Gupta, A. Iosevich, J. Iosevich et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
