اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIntersection between pencils of tubes, discretized sum-product, and radial projections
105
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we prove the following results in the plane. They are related to each other, while each of them has its own interest. First we obtain an $epsilon_0$-increment on intersection between pencils of $delta$-tubes, under non-concentration conditions. In fact we show it is equivalent to the discretized sum-product problem, thus the $epsilon_0$ follows from Bourgains celebrated result. Then we prove a couple of new results on radial projections. We also discussion about the dependence of $epsilon_0$ and make a new conjecture. A tube condition on Frostman measures, after careful refinement, is also given.
قيم البحث
اقرأ أيضاً
We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets contained in a s
phere. We use these incidence bounds to obtain significant improvements on the arithmetic problem of covering ${mathbb F}_q$, the finite field with q elements, by $A cdot A+... +A cdot A$, where A is a subset ${mathbb F}_q$ of sufficiently large size. We also use the incidence machinery we develope and arithmetic constructions to study the Erdos-Falconer distance conjecture in vector spaces over finite fields. We prove that the natural analog of the Euclidean Erdos-Falconer distance conjecture does not hold in this setting due to the influence of the arithmetic. On the positive side, we obtain good exponents for the Erdos -Falconer distance problem for subsets of the unit sphere in $mathbb F_q^d$ and discuss their sharpness. This results in a reasonably complete description of the Erdos-Falconer distance problem in higher dimensional vector spaces over general finite fields.
By a result of Schur [J. Reine Angew. Math. 1911], the entrywise product $M circ N$ of two positive semidefinite matrices $M,N$ is again positive. Vybiral [Adv. Math. 2020] improved on this by showing the uniform lower bound $M circ overline{M} geq E
_n / n$ for all $n times n$ real or complex correlation matrices $M$, where $E_n$ is the all-ones matrix. This was applied to settle a conjecture of Novak [J. Complexity 1999] and to positive definite functions on groups. Vybiral (in his original preprint) asked if one can obtain similar uniform lower bounds for higher entrywise powers of $M$, or for $M circ N$ when $N eq M, overline{M}$. A natural third question is to obtain a tighter lower bound that need not vanish as $n to infty$, i.e. over infinite-dimensional Hilbert spaces. In this note, we affirmatively answer all three questions by extending and refining Vybirals result to lower-bound $M circ N$, for arbitrary complex positive semidefinite matrices $M, N$. Specifically: we provide tight lower bounds, improving on Vybirals bounds. Second, our proof is conceptual (and self-contained), providing a natural interpretation of these improved bounds via tracial Cauchy-Schwarz inequalities. Third, we extend our tight lower bounds to Hilbert-Schmidt operators. As an application, we settle Open Problem 1 of Hinrichs-Krieg-Novak-Vybiral [J. Complexity, in press], which yields improvements in the error bounds in certain tensor product (integration) problems.
For smooth convex disks $A$, i.e., convex compact subsets of the plane with non-empty interior, we classify the classes $G^{text{hom}}(A)$ and $G^{text{sim}}(A)$ of intersection graphs that can be obtained from homothets and similarities of $A$, resp
ectively. Namely, we prove that $G^{text{hom}}(A)=G^{text{hom}}(B)$ if and only if $A$ and $B$ are affine equivalent, and $G^{text{sim}}(A)=G^{text{sim}}(B)$ if and only if $A$ and $B$ are similar.
Two-dimensional linear spaces of symmetric matrices are classified by Segre symbols. After reviewing known facts from linear algebra and projective geometry, we address new questions motivated by algebraic statistics and optimization. We compute the
reciprocal curve and the maximum likelihood degrees, and we study strata of pencils in the Grassmannian.
Let $A$ be a compact set in $mathbb{R}$, and $E=A^dsubset mathbb{R}^d$. We know from the Mattila-Sjolins theorem if $dim_H(A)>frac{d+1}{2d}$, then the distance set $Delta(E)$ has non-empty interior. In this paper, we show that the threshold $frac{d+1}{2d}$ can be improved whenever $dge 5$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
