Related papers: On Perles' configuration
In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…
Based on an ordering with directed lines and using constructions instead of existential axioms, von Plato proposed a constructive axiomatization of the ordered affine geometry. There are 22 axioms for the ordered affine geometry, of which…
In this paper we prove that the generalized version of the Minimal Resolution Conjecture stated by Mustata holds for certain general sets of points on a smooth cubic surface $X \subset \mathbb{P}^3$. The main tool used is Gorenstein liaison…
In this paper we discuss, from a historical and philosophical point of view, a variation of the meaning of the five postulates in Euclidean Geometry and we make a short reference to D. Hilberts formalism. We examine, throughout the ages,…
Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…
We give explicit realizations with small integer coordinates for all triangulated tori with up to 12 vertices. In particular, we provide coordinate-minimal realizations in general position for all triangulations of the torus with 7, 8, 9,…
It is known that cyclic arrangements are the only {\em unavoidable} simple arrangements of pseudolines: for each fixed $m\ge 1$, every sufficiently large simple arrangement of pseudolines has a cyclic subarrangement of size $m$. In the same…
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any…
We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
Consider the projections of a finite set $A\subset R^n$ onto the coordinate hyperplanes. How small can the sum of the sizes of these projections be, given the size of $A$? In a different form, this problem has been studied earlier in the…
One way to characterize configurations of points up to congruence is by considering the distribution of all mutual distances between points. This paper deals with the question if point configurations are uniquely determined by this…
In 1888, Heinrich Schroeter provided a ruler construction for points on cubic curves based on line involutions. Using Chasles' Theorem and the terminology of elliptic curves, we give a simple proof of Schroeter's construction. In addition,…
A celebrated conjecture due to De Giorgi states that any bounded solution of the equation $\Delta u + (1-u^2) u = 0 \hbox{in} \R^N $ with $\pp_{y_N}u >0$ must be such that its level sets $\{u=\la\}$ are all hyperplanes, {\em \bf at least}…
Let $X$ be a smooth projective algebraic variety over a number field $k$ and $P$ in $X(k)$. In 2007, the second author conjectured that, in a precise sense, if rational points on $X$ are dense enough, then the best rational approximations…
An $n$-arc in a projective plane is a collection of $n$ distinct points in the plane, no three of which lie on a line. Formulas counting the number of $n$-arcs in any finite projective plane of order $q$ are known for $n \le 8$. In 1995,…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
A complex projective manifold is rationally connected, resp. rationally simply connected, if finite subsets are connected by a rational curve, resp. the spaces parameterizing these connecting rational curves are themselves rationally…
In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…
A normal projective complex surface is called a rational homology projective plane if it has the same Betti numbers with the complex projective plane $\mathbb{C}\mathbb{P}^2$. It is known that a rational homology projective plane with…