2016
DOI: 10.4310/mrl.2016.v23.n6.a8
|View full text |Cite
|
Sign up to set email alerts
|

On angles determined by fractal subsets of the Euclidean space

Abstract: We prove that if the Hausdorff dimension of a compact subset of R d is greater than d+1 2 , then the set of angles determined by triples of points from this set has positive Lebesgue measure. Sobolev bounds for bi-linear analogs of generalized Radon transforms and the method of stationary phase play a key role. These results complement those of V. Harangi, T. Keleti, G. Kiss, P. Maga, P. Mattila and B. Stenner in ([8]). We also obtain new upper bounds for the number of times an angle can occur among N points i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(15 citation statements)
references
References 12 publications
0
15
0
Order By: Relevance
“…We already established using Theorem [9] that finite compositions of the operators T l applied to L 2 (µ) functions are in L 2 (µ). Using the Cauchy-Schwarz inequality and in light of Lemma 2.5, we M k (t 1 + h 1 , t 2 + h 2 , · · · , t k + h k ) is bounded.…”
Section: Lower Bound For Variable Gapsmentioning
confidence: 99%
See 2 more Smart Citations
“…We already established using Theorem [9] that finite compositions of the operators T l applied to L 2 (µ) functions are in L 2 (µ). Using the Cauchy-Schwarz inequality and in light of Lemma 2.5, we M k (t 1 + h 1 , t 2 + h 2 , · · · , t k + h k ) is bounded.…”
Section: Lower Bound For Variable Gapsmentioning
confidence: 99%
“…× E. Theorem 1.8 gives an upper bound on this expression that is independent of . This is accomplished using an inductive argument on the chain length coupled with repeated application of an earlier result from [9] in which the authors establish L 2 (µ) mapping properties of certain convolution operators. This upper bound is important in the final section where we define a measure on the set of chains.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In particular, it would seemingly be more natural to work with simplices and replace distance by volume or configuration sets. The articles [9][10][11]17] have all been motivated to do just this by formulating and proving variants of Falconer-type problems, for example, for Vol(E) = {vol(Σ n (x)) : x = (x 1 , . .…”
Section: Introductionmentioning
confidence: 99%
“…As was noted in [17], little is known, in general, about the distribution of angles determined by points in unbounded discrete subsets of R n once n 4. Whereas the results proved in [17] require the hypothesis of s-adaptability, we give a solution to a Falconer problem for angles for any compatible self-similar subset of Z n once n 4 with no other hypothesis. The statement is given in Theorem 2 and proved in § 3.2.…”
Section: Introductionmentioning
confidence: 99%