Related papers: The $n$-dimensional Peano Curve
Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…
The Gauss-Bonnet Formula is a significant achievement in 19th century differential geometry for the case of surfaces and the 20th century cumulative work of H. Hopf, W. Fenchel, C. B. Allendoerfer, A. Weil and S.S. Chern for…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and…
In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…
The Eynard-Orantin invariants of a plane curve are multilinear differentials on the curve. For a particular class of genus zero plane curves these invariants can be equivalently expressed in terms of simpler expressions given by polynomials…
We introduce variational approximations for curve evolutions in two-dimensional Riemannian manifolds that are conformally flat, i.e.\ conformally equivalent to the Euclidean space. Examples include the hyperbolic plane, the hyperbolic disk,…
The Picard number of a Fano manifold X obtained by blowing up a curve in a smooth projective variety is known to be at most 5, in any dimension greater than or equal to 4. We show that the Picard number attains to the maximal if and only if…
The aim of this book is to provide an elementary introduction, complete with detailed proofs, to the celebrated tilings of the plane discovered by Sir Roger Penrose in the `70s. The book covers many aspects of Penrose tilings, including the…
The Q-curvature has been playing a central role in conformal geometry since its discovery by T. Branson. It has natural analogy in CR geometry, however, the CR Q-curvature vanishes on the boundary of a strictly pseudoconvex domain in…
The notion of two-numbers of connected Riemannian manifolds was introduced about 35 years ago in [Un invariant geometrique riemannien, C. R. Acad. Sci. Paris Math. 295 (1982), 389--391] by B.-Y. Chen and T. Nagano. Later, two-numbers have…
This paper discusses a central theorem in birational geometry first proved by Eugenio Bertini in 1891. J.L. Coolidge described the main ideas behind Bertini's proof, but he attributed the theorem to Clebsch. He did so owing to a short note…
We show that for every positive integer n there is a simple closed curve in the plane (which can be taken infinitely differentiable and convex) which has exactly n inscribed squares.
In this paper, we present a new explicit formula for the curvatures of a regular curve with an arbitrary parameter in the Euclidean space $\mathbb{R}^n$, $n\geq 2$, expressed only in terms of its derivatives. We introduce also the notion of…
While research on the geometry of planar graphs has been active in the past decades, many properties of planar metrics remain mysterious. This paper studies a fundamental aspect of the planar graph geometry: covering planar metrics by a…
Numerical ranges over a certain family of finite fields were classified in 2016 by a team including our fifth author. Soon afterward, in 2017 Ballico generalized these results to all finite fields and published some new results about the…
A plane quartic curve is called L\"uroth if it contains the ten vertices of a complete pentalateral. White and Miller constructed in 1909 a covariant quartic 4-fold, associated to any plane quartic. We review their construction and we show…
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…
In 1989, Erd\H{o}s conjectured that for a sufficiently large $n$ it is impossible to place $n$ points in general position in a plane such that for every $1\le i \le n-1$ there is a distance that occurs exactly $i$ times. For small $n$ this…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…