中文
相关论文

相关论文: Polynomial partitioning on varieties of codimensio…

200 篇论文

The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given $n$-point set $P\subset\mathbb{R}^d$ using the zero set $Z(f)$ of a suitable…

数据结构与算法 · 计算机科学 2015-07-20 Jiri Matousek , Zuzana Patakova

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

组合数学 · 数学 2016-09-29 Micha Sharir , Noam Solomon

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…

组合数学 · 数学 2017-05-01 Micha Sharir , Noam Solomon

In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…

组合数学 · 数学 2023-01-13 Ali Mohammadi , Thang Pham , Audie Warren

Inspired by piecewise polynomiality results of double Hurwitz numbers, Ardila and Brugall\'e introduced an enumerative problem which they call double Gromov--Witten invariants of Hirzebruch surfaces. These invariants serve as a…

代数几何 · 数学 2025-08-22 Marvin Anas Hahn , Vincenzo Reda

This paper focuses on incidences over finite fields, extending to higher degrees a result by Vinh \cite{VINH20111177} on the number of point-line incidences in the plane $\mathbb{F}^2$, where $\mathbb{F}$ is a finite field. Specifically, we…

信息论 · 计算机科学 2023-12-21 Itzhak Tamo

We study incidence problems involving points and curves in $R^3$. The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of tools from algebraic geometry, most notably (i) the…

组合数学 · 数学 2020-07-09 Micha Sharir , Noam Solomon

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

代数几何 · 数学 2007-05-23 Alessandra Sarti

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

组合数学 · 数学 2015-12-07 Misha Rudnev

In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines…

组合数学 · 数学 2021-02-16 Marton Hablicsek , Zachary Scherr

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

代数几何 · 数学 2025-06-09 Yifan Zhang , Joe Kileel

We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending…

组合数学 · 数学 2025-09-23 Chong Shangguan , Yulin Yang , Tao Zhang

We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…

代数几何 · 数学 2015-06-03 Micha Sharir , Noam Solomon

We prove almost tight bounds on incidences between points and $k$-dimensional varieties of bounded degree in $\R^d$. Our main tools are the Polynomial Ham Sandwich Theorem and induction on both the dimension and the number of points.

组合数学 · 数学 2017-03-17 Jozsef Solymosi , Terence Tao

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

组合数学 · 数学 2015-03-31 Hong Wang , Ben Yang , Ruixiang Zhang

We prove bounds on the number of incidences between a set of algebraic curves in $\mathbb{C}^2$ and a Cartesian product $A\times B$ with finite sets $A,B\subset \mathbb{C}$. Similar bounds are known under various conditions, but we show…

组合数学 · 数学 2015-11-03 József Solymosi , Frank de Zeeuw

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

组合数学 · 数学 2025-05-01 Xiangliang Kong , Itzhak Tamo

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

微分几何 · 数学 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We prove an analogue of a theorem of A. Pollington and S. Velani ('05), furnishing an upper bound on the Hausdorff dimension of certain subsets of the set of very well intrinsically approximable points on a quadratic hypersurface. The proof…

数论 · 数学 2017-09-18 Lior Fishman , Keith Merrill , David Simmons

The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as…

组合数学 · 数学 2024-04-04 Aleksa Milojević , István Tomon , Benny Sudakov
‹ 上一页 1 2 3 10 下一页 ›