Abstract

Let $d\in\mathbb{Z}^+t$, $\mathbb{K}$ be a field of characteristic zero and $A$ be a nonempty finite subset of $\mathbb{K}^2$. Denote by $\mathcal{C}_{d,\mathbb{K}}$ the family of algebraic curves of degree $d$ in $\mathbb{K}^2$ and $\mathcal{C}_{\leq d,\mathbb{K}}:=\bigcup_{e=1}^d\mathcal{C}_{e,\mathbb{K}}$. For any $C_1\in \mathcal{C}_{d,\mathbb{K}}$, we say that $C_1$ is determined by $A$ if for any $C_2\in\mathcal{C}{d,\mathbb{K}}$ such that $C_2\cap A\supseteq C_1\cap A$, we have that $C_1=C_2$; we denote by $\mathcal{D}_{d,\mathbb{K}}(A)$ the family of elements of $\mathcal{C}_{d,\mathbb{K}}$ determined by $A$. Beck's theorem establishes that if $\mathbb{K}=\mathbb{R}$ and $A$ is not collinear, then $$|\mathcal{D}_{1,\mathbb{R}}(A)|=\Theta\left(|A|\min_{C\in \mathcal{C}_{1,\mathbb{R}}}|A\setminus C|\right).$$ In this paper we generalize Beck's theorem showing that for all $d\in\mathbb{Z}^+$, there exists a constant $c=c(d)>0$ such that if $\min_{C\in\mathcal{C}_{\leq d,\mathbb{K}}}|A\setminus C|>c,$ then $$|\mathcal{D}_{d,\mathbb{K}}(A)|=\Theta_d\left(|A|^d\prod_{e=1}^d\left(\min_{C\in \mathcal{C}_{\leq e,\mathbb{K}}}|A\setminus C|\right)^{d-e+1}\right).$$

Highlights

  • In this paper R, C, Q, Z, Z+, +Z0 denote the set of real numbers, complex numbers, rational numbers, integers, positive integers and nonnegative integers, respectively

  • C2 ∈ Cd,K such that C2 ∩ A ⊇ C1 ∩ A, we have that C1 = C2; we denote by Dd,K(A)

  • A curve of degree d in K2 is a subset C of K2 which is the zero set of a polynomial in K[x, y] of degree d; we denote by Cd,K the family of curves of degree d in K2 and C d,K :=

Read more

Summary

Introduction

Z0 denote the set of real numbers, complex numbers, rational numbers, integers, positive integers and nonnegative integers, respectively. Beck’s theorem has important applications in different areas of mathematics, and it has opened a new research field in combinatorial geometry, see for instance [1], [4], [6], [7], [13], [16] Another important family of problems in combinatorial geometry is to bound the number of curves with a given degree that are determined by A and satisfy other conditions (for example, in the Sylvester-Gallai type results, the curves have to pass through few points of A), see for instance [2], [3], [5], [19]. Lund’s theorem works only for K = C (and K = R) so, to conclude the proof of Theorem 2 for arbitrary fields of characteristic zero, we need a Lefschetz principle type results. As it is explained above, we need to bound the number of hyperplanes generated by the image of A under the Veronese map, and to translate this information into the original problem. After we conclude the proof of Theorem 2, we discuss some facts about the constants in Theorem 2, possible generalizations, etc

Preliminaries
Curves and hyperplanes
Proof of Theorem 2
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.