Adrian Claudiu Valculescu
The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and one has been submitted for publication (and also appeared as a preprint on the arxiv, and as an extendend abstract in a conference). Specifically, we deal with the following four problems: \begin{enumerate} \item We prove that if M∈C2×2 is an invertible matrix, and BM:C2×C2→C is a bilinear form BM(p,q)=pTMq, then any finite set S contained in an irreducible algebraic curve C of degree d in C2 determines Ωd(∣S∣4/3) distinct values of BM, unless C is a line, or is linearly equivalent to a curve defined by an equation of the form xk=yl, with k,l∈Z\0, and gcd(k,l)=1. \item We show that if we are given m points and n lines in the plane, then the number of distinct distances between the points and the lines is Ω(m1/5n3/5), as long as m1/2≤n≤m2. Also, we show that if we are given m points in the plane, not all collinear, then the number of distances between these points and the lines that they determine is Ω(m4/3). We also study three-dimensional versions of the distinct point-line distances problem. \item We prove the lower bound Ω(∣S∣4) on the number of ordinary conics determined by a finite point set S in R2, assuming that S is not contained in a conic, and at most c∣S∣ points of S lie on the same line (for some $0 EPFL2017