Related papers: Points defining triangles with distinct circumradi…
We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As…
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…
We consider elliptic curves defined by an equation of the form $y^2=x^3+f(t)$, where $f\in k[t]$ has coefficients in a perfect field $k$ of characteristic not $2$ or $3$. By performing $2$ and $3$-descent, we obtain, under suitable…
An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…
The aim of this paper is to generalize Apollonius' problem. The problem is to construct a circle that is tangent to three given circles in a plane. We find the maximum possible number of solution circles in the case of more than the three…
The multiplicity of an algebraic curve $C$ in the complex plane at a point $p$ on that curve is defined as the number of points that occur at the intersection of $C$ with a general complex line that passes close to the point $p$. It is…
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
If there is one polygon inscribed into some smooth conic and circumscribed about another one, then there are infinitely many such polygons. This is Poncelet's theorem. The aim of this note is to collect some (mostly classical) versions of…
Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…
We consider the 3 by 3 determinant polynomial and we describe the limit points of the set of all polynomials obtained from the determinant polynomial by linear change of variables. This answers a question of J. M. Landsberg.
We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given $t$, what is the maximum number of points that can be placed in the plane to…
A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
We prove the following Theorem: Given any three distinct points on a straight line r, there exist an equilateral triangle, whose circumcenter lies on r, such that the projections of its vertices on r are exactly the three given points.
We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that for any convex shape $K$, there exist four points on the boundary of $K$ such that the length of any curve…
We introduce the notion of tropical area of a tropical curve defined in an open subset of $\mathbb R^n$. We prove that the number of vertices of a tropical curve is bounded by the area of the curve. The approach is totally elementary yet…
We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…
By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…