John Bueti
We discuss a planar variant of the Kakeya maximal function in the setting of a vector space over a finite field. Using methods from incidence combinatorics, we demonstrate that the operator is bounded from $L^p$ to $L^q$ when $1 \leq p \leq \frac{kn+k+1}{k(k+1)}$ and $1 \leq q \leq (n-k)p'$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Refinements on the Restriction and Kakeya problems range in $\mathbb{R}^4$
通过证明两个两端点关联估计，改进了 $\mathbb{R}^4$ 中 Fourier 限制性与 Kakeya 极大估计的范围，并探讨了对 Kakeya 集维数下界和 Bochner--Riesz 猜想的影响。
We completely characterize the boundedness of planar directional maximal operators on L^p. More precisely, if Omega is a set of directions, we show that M_Omega, the maximal operator associated to line segments in the directions Omega, is unbounded on L^p, for all p < infinity, precisely when Omega admits Kakeya-type sets. In fact, we show that if Omega does not admit Kakeya sets, then Omega is a generalized lacunary set, and hence M_Omega is bounded on L^p, for p>1.
An incidence of a graph $G$ is a vertex-edge pair $(v,e)$ such that $v$ is incidence with $e$. A conflict-free incidence coloring of a graph is a coloring of the incidences in such a way that two incidences $(u,e)$ and $(v,f)$ get distinct colors if and only if they conflict each other, i.e.,(i) $u=v$, (ii) $uv$ is $e$ or $f$, or (iii) there is a vertex $w$ such that $uw=e$ and $vw=f$. The minimum number of colors used among all conflict-free incidence colorings of a graph is the conflict-free incidence chromatic number. A graph is outer-1-planar if it can be drawn in the plane so that vertice…
We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric realization of the incidence geometry is infinitesimally rigid in regular position if and only if the resulting cone graph is infinitesimally rigid in generic position. This is a generalization of the Molecular conjecture.
Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number, were established. Consequently, we deduced an upper bound and a lower bound of the incidence chromatic number for all graphs. Using these bounds, we further reduced the upper bound of the incidence chromatic number of planar graphs and showed that cubic graphs with orders not divisible by four are not 4-incidence colorable. The incidence chromatic numbers of Cartesian product, join and union of graphs were also determined.
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we will discuss are: (1) Counting incidences: Given a set (or several sets) of geometric objects (lines, points, etc..), what is the maximum number of incidences (or intersections) that can exist between elements in different sets? We will see several results of this type, such as the Szemeredi-Trotter theorem, over the reals and over finite fields and discuss…
Horizontal Kakeya maximal operators in finite Heisenberg groups: Exact exponents and applications
研究有限Heisenberg群中与水平线相关的Kakeya极大算子，通过傅里叶分析得到秩一时精确的混合范数增长指数，并应用于组合几何中的点线配置问题。
This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss the rigidity properties of geometric realizations of incidence geometries in relation to the rigidity of geometric realizations of other well-known structures, such as graphs and hypergraphs.The $2$-plane matroid is also discussed. Further, we extend a result of Whiteley to determine necessary conditions for an incidence geometry of points and lines with exac…
Hyperplane Incidences and Distance Sets in Higher Dimensions
将二维点线相交界推广至高维，改进三维和四维Falconer距离集问题，并推广Furstenberg集界至任意维度。
Vertical projections in the Heisenberg group via cinematic functions and point-plate incidences
该研究针对第一海森堡群中的垂直投影问题，分别借助cinematic函数方法、引入水平线与圆锥线的点线对偶转化为点-板关联问题，拓展了博雷尔集豪斯多夫维数相关投影结论的适用范围。
A planar algebraic Zarankiewicz theorem over prime fields
本文在素数域上证明了平面代数Zarankiewicz定理，给出二部图关联界，并推广至代数族，应用于富分量、差集多项式值与多项式展开。
We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{3/2}} + n\right)$. Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM …
We establish the optimal lower bound $\gtrsim N$ for counting the number of distinct inner products of pairs from any $N$ given vectors in $\R^2$. Essentially, we lift a related incidence structure defined by inner products in the plane to $\R^3$ and derive our bound by showing that the lifted structures result in planar graphs.
In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $Ω\left(n^{7/9}/{\rm polylog} \,n\right)$. This bound is significantly larger than the conjectured bound $Ω(n^{2/3})$ for general point sets in $\mathbb R^3$. We also show that the number of unit distances determined by $n$ points on a surface $V$, as above, is $O(n^{4/3})$, a bound that matches the best known planar bound, and is worst-case tight in 3-space. This is in sharp contrast with the bes…
We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is $O*(m^{2/3}n^{2/3} + m^{6/11}n^{9/11}+m+n)$, where the $O*(\cdot)$ notation hides sub-polynomial factors. Since all the points and circles may lie on a common plane (or sphere), it is impossible to improve the bound in R^3 without first improving it in the plane. Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。