Related papers: Distinct Distances on Curves via Rigidity

We generalize Pach and de Zeeuw's bound for distinct distances between points on two curves, from algebraic curves to Pfaffian curves. Pfaffian curves include those that can be defined by any combination of elementary functions, including…

We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…

First, this paper presents a systematic procedure for constructing criteria for singularities of curves of finite multiplicities in $\boldsymbol{R}^N$. Based on this method, we provide explicit criteria for singularities of multiplicities…

Let $X$ be a minuscule homogeneous space, an odd quadric, or an adjoint homogenous space of type different from $A$ and $G_2$. Le $C$ be an elliptic curve. In this paper, we prove that for $d$ large enough, the scheme of degree $d$…

We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…

We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…

Erd\H{o}s' unit distance problem and Erd\H{o}s' distinct distances problem are among the most classical and well-known open problems in discrete mathematics. They ask for the maximum number of unit distances, or the minimum number of…

For any graph $G = (V,E)$ and positive integer $d$, the exact distance-$d$ graph $G_{=d}$ is the graph with vertex set $V$, where two vertices are adjacent if and only if the distance between them in $G$ is $d$. We study the exact…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Let $X$ be an irreducible projective variety of dimension $n$ in a projective space and let $x$ be a point of $X$. Denote by ${\rm Curves}_d(X,x)$ the space of curves of degree $d$ lying on $X$ and passing through $x$. We will show that the…

We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…

We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…

For real irreducible algebraic curves of the seventh degree, there are 22 types of singular points of multiplicity six, 174 types of singular points of multiplicity five, and at least 182 types of singular points of multiplicity four. For…

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

We study minimum degree conditions that guarantee that an $n$-vertex graph is rigid in $\mathbb{R}^d$. For small values of $d$, we obtain a tight bound: for $d = O(\sqrt{n})$, every $n$-vertex graph with minimum degree at least $(n+d)/2 -…