12 citations · 64 across the 43 of their papers we have counts for
52 papers
The Erdős-Falconer distance problem in the integer lattice
Eyvindur Ari Palsson, Jian-An Wang
In this paper we propose and study what we call the Erdős-Falconer distance problem in the integer lattice. One motivation is Magyar's discrete analog of the result of Furstenberg,…
Sharp Thresholds for Distance Patterns in Random Subsets of
Christina Giannitsi, Eyvindur Ari Palsson
Let , , and be the binomial random subset of with retention probability . We prove that, with failure…
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…
Pinned nonempty interior and volumes of simplices
Eyvindur Ari Palsson, Georgios Psaromiligkos
We study pinned nonempty-interior problems for scalar two-point configurations and for volumes of simplices. For , , compact and a smooth scalar conf…
Sharp higher order regularity of discrete maximal functions
Sung-Yi Liao, José Madrid, Eyvindur Palsson +1
We derive sharp bounds for the th derivative of the discrete uncentered maximal operator applied to characteristic functions in the…
improving estimates for multilinear forms motivated by distance graphs
Eyvindur Palsson, Jennifer Smucker
We undertake a systematic study of the mapping properties of forms based on distance graphs in to see how the structure of a graph, , affects the imp…