中文
相关论文

相关论文: Elementary incidence theorems for complex numbers …

200 篇论文

We show that every set $\mathcal{P}$ of $n$ non-collinear points in the plane contains a point incident to at least $\lceil\frac{n}{3}\rceil+1$ of the lines determined by $\mathcal{P}$.

组合数学 · 数学 2017-01-24 Zeye Han

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

组合数学 · 数学 2023-07-25 Jozsef Solymosi

Let $S$ be a set of $n\geq 7$ points in the plane, no three of which are collinear. Suppose that $S$ determines $n+1$ directions. That is to say, the segments whose endpoints are in $S$ form $n+1$ distinct slopes. We prove that $S$ is, up…

组合数学 · 数学 2021-01-22 Cédric Pilatte

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

组合数学 · 数学 2015-03-20 Ben Green , Terence Tao

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

组合数学 · 数学 2011-06-29 Larry Guth , Nets Hawk Katz

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

组合数学 · 数学 2012-07-17 Ida Kantor , Balazs Patkos

Given a set of $s$ points and a set of $n^2$ lines in three-dimensional Euclidean space such that each line is incident the $n$ points but no $n$ lines are coplanar, then we have $s=\Omega(n^{11/4})$. This is the first nontrivial answer to…

组合数学 · 数学 2013-12-17 Jozsef Solymosi , Csaba D. Toth

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…

综合数学 · 数学 2024-10-14 Alexandros Haridis

We study abelian varieties $A$ with multiplication by a totally indefinite quaternion algebra over a totally real number field and give a criterion for the existence of principal polarizations on them in pure arithmetic terms. Moreover, we…

数论 · 数学 2007-05-23 Victor Rotger

J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…

组合数学 · 数学 2010-10-20 Gregory S. Warrington

A conjecture of Coleman implies that only finitely many quaternion algebras over the rational numbers can be the endomorphism $\mathbf{Q}$-algebras of abelian surfaces over the complex numbers which can be defined over $\mathbf{Q}$. One may…

数论 · 数学 2017-01-24 James Stankewicz

We apply an old method for constructing points-and-lines configurations in the plane to study some recent questions in incidence geometry.

度量几何 · 数学 2007-05-23 Noam D. Elkies

The Miquel-Steiner theorem for a quadrilateral in the Euclidean plane states that the circumcircles of the four component triangles intersect at a single point, which now is called the Miquel-Steiner point of the quadrilateral. In elliptic…

度量几何 · 数学 2026-05-26 Manfred Evers

Let $L$ be a set of $n$ lines in $R^3$ that is contained, when represented as points in the four-dimensional Pl\"ucker space of lines in $R^3$, in an irreducible variety $T$ of constant degree which is \emph{non-degenerate} with respect to…

组合数学 · 数学 2022-02-11 Micha Sharir , Noam Solomon

Let $S$ be a finite subset of ${\mathbb R}^2 \setminus (0,0)$. Generally, one would expect the pattern of lines $Ax + By = 1$, where $(A, B) \in S$ to contain polygons of all shapes and sizes. We show, however, that when $S$ is a…

组合数学 · 数学 2023-12-21 Milena Harned , Iris Liebman

In this paper we prove, for all $d \ge 2$, that for no $s<\frac{d+1}{2}$ does $I_s(\mu)<\infty$ imply the canonical Falconer distance problem incidence bound, or the analogous estimate where the Euclidean norm is replaced by the norm…

组合数学 · 数学 2010-06-09 Alex Iosevich , Steven Senger

In this paper, we study a point-hyper plane incidence theorem in matrix rings, which generalizes all previous works in literature of this direction.

组合数学 · 数学 2022-08-22 Nguyen Van The , Le Anh Vinh

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

组合数学 · 数学 2026-05-21 Andrew Suk , Su Zhou

Let $p_1,p_2,p_3$ be three distinct points in the plane, and, for $i=1,2,3$, let $\mathcal C_i$ be a family of $n$ unit circles that pass through $p_i$. We address a conjecture made by Sz\'ekely, and show that the number of points incident…

度量几何 · 数学 2016-07-14 Orit E. Raz , Micha Sharir , József Solymosi

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

环与代数 · 数学 2022-09-30 Maximilian Illmer , Tim Netzer