<p>We study a variant of the Falconer distance problem for dot products. In particular, for fractal subsets <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(A\subset \mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mo>⊂</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(a,x\in \mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>,</mo> <mi>x</mi> <mo>∈</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>, we study sets of the form <Equation ID="Equ13"> <EquationSource Format="TEX">\(\Pi _x^a(A) := \{\alpha \in \mathbb {R}: (a-x)\cdot y= \alpha , {\text { for some }} y\in A\}.\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <msubsup> <mi mathvariant="normal">Π</mi> <mi>x</mi> <mi>a</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> <mo>:</mo> <mo>=</mo> <mrow> <mo stretchy="false">{</mo> <mi>α</mi> <mo>∈</mo> <mi mathvariant="double-struck">R</mi> <mo>:</mo> <mrow> <mo stretchy="false">(</mo> <mi>a</mi> <mo>-</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>·</mo> <mi>y</mi> <mo>=</mo> <mi>α</mi> <mo>,</mo> <mrow> <mspace width="0.333333em" /> <mtext>for some</mtext> <mspace width="0.333333em" /> </mrow> <mi>y</mi> <mo>∈</mo> <mi>A</mi> <mo stretchy="false">}</mo> </mrow> <mo>.</mo> </mrow> </math></EquationSource> </Equation>We give a picture of the current state of the art by discussing what is known, and we prove some new results and special cases. We obtain lower bounds on the Hausdorff dimension of <i>A</i> to guarantee that <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\Pi ^a_x(A)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi mathvariant="normal">Π</mi> <mi>x</mi> <mi>a</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is large in some quantitative sense for some <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(a\in A\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>∈</mo> <mi>A</mi> </mrow> </math></EquationSource> </InlineEquation> (i.e.,<InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\Pi _x^a(A)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi mathvariant="normal">Π</mi> <mi>x</mi> <mi>a</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> has large Hausdorff dimension, positive measure, or nonempty interior). Our approach to all three senses of “size” is the same, and we make use of both classical and recent results on projection theory.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Pinned dot product set estimates

  • Paige Bright,
  • Caleb Marshall,
  • Steven Senger

摘要

We study a variant of the Falconer distance problem for dot products. In particular, for fractal subsets \(A\subset \mathbb {R}^n\) A R n and \(a,x\in \mathbb {R}^n\) a , x R n , we study sets of the form \(\Pi _x^a(A) := \{\alpha \in \mathbb {R}: (a-x)\cdot y= \alpha , {\text { for some }} y\in A\}.\) Π x a ( A ) : = { α R : ( a - x ) · y = α , for some y A } . We give a picture of the current state of the art by discussing what is known, and we prove some new results and special cases. We obtain lower bounds on the Hausdorff dimension of A to guarantee that \(\Pi ^a_x(A)\) Π x a ( A ) is large in some quantitative sense for some \(a\in A\) a A (i.e., \(\Pi _x^a(A)\) Π x a ( A ) has large Hausdorff dimension, positive measure, or nonempty interior). Our approach to all three senses of “size” is the same, and we make use of both classical and recent results on projection theory.