Related papers: A Poncelet theorem for lines
The Apollonius problem asks for a sphere tangent to $n+1$ given spheres or hyperplanes in $\mathbb{R}^n$. This problem has been widely studied for an isolated configuration of $n+1$ spheres. In this paper, we study relations among the…
Let $\mathcal{K}$ denote a nonsingular conic in the complex projective plane. Pascal's theorem says that, given six distinct points $A,B,C,D,E,F$ on $\mathcal{K}$, the three intersection points $AE \cap BF, AD \cap CF, BD \cap CE$ are…
A two-dimensional $n$-correct set is a set of nodes admitting unique bivariate interpolation with polynomials of total degree at most ~$n$. We are interested in correct sets with the property that all fundamental polynomials are products of…
A regular $n$-gon inscribing a knot is a sequence of $n$ points on a knot, such that the distances between adjacent points are all the same. It is shown that any smooth knot is inscribed by a regular $n$-gon for any $n$.
Small codimensional embedded manifolds defined by equations of small degree are Fano and covered by lines. They are complete intersections exactly when the variety of lines through a general point is so and has the right codimension. This…
The number of apparent double points of a smooth, irreducible projective variety $X$ of dimension $n$ in $\Proj^{2n+1}$ is the number of secant lines to $X$ passing through the general point of $\Proj^{2n+1}$. This classical notion dates…
We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…
The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…
According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has at most $2^{n+O\left({n^{2/3}\log n}\right)}$…
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…
We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…
Let $J$ be a simple closed curve in $\mathbb R^{k}$ $(k\geq2)$ that is differentiable with non-zero derivative at a point $A_0\in J$. For a tuple of positive reals $a_1,\cdots,a_n$ $(n\geq3)$, each of which is less than the sum of the…
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…
We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
A linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…
For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…
In this paper, we proved that any 2-convex solution $u$ of $\sigma_2(D^2u)=1$ with a quadratic growth must be a quadratic polynomial in $\mathbb{R}^n\ (n\geq 3 )$ by using a Pogorelov estimate and the global gradient estimate. And we give a…
A system of plane curves defined by prescribing n points of multiplicity m in general position is regular if n > (2m)^2. The proof uses computation of limits of linear systems acquiring fixed divisors, an interesting problem in itself.
Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…