Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Finite configurations in sparse sets (1307.1174v1)

Published 3 Jul 2013 in math.CA

Abstract: Let $E \subseteq Rn$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let ${B_1,\ldots,B_k}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is sufficiently close to $n$, and if $E$ supports a probability measure obeying appropriate dimensionality and Fourier decay conditions, then for a range of $m$ depending on $n$ and $k$, the set $E$ contains a translate of a non-trivial $k$-point configuration ${B_1y,\ldots,B_ky}$. As a consequence, we are able to establish existence of certain geometric configurations in Salem sets (such as parallelograms in $ Rn$ and isosceles right triangles in $R2$). This can be viewed as a multidimensional analogue of an earlier result of Laba and Pramanik on 3-term arithmetic progressions in subsets of $R$.

Summary

We haven't generated a summary for this paper yet.