Related papers: Distinct Distances on Curves via Rigidity

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an…

Let $C$ be an irreducible projective plane curve in the complex projective space ${\mathbb{P}}^2$. The classification of such curves, up to the action of the automorphism group $PGL(3,{\mathbb{C}})$ on ${\mathbb{P}}^2$, is a very difficult…

Let a set of nodes $\mathcal X$ in plain be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Suppose also that $|\mathcal X|= d(n,k-2)+2,$ where $d(n,k-2) = (n+1)+n+\cdots+(n-k+4)$ and $\ k\le n-1.$ In this paper…

In case of a standard form vN-algebra, the Bures distance is the natural distance between the fibres of implementing vectors at normal positive linear forms. Thereby, it is well-known that to each two normal positive linear forms…

There are thirteen types of singular points for irreducible real quartic curves and seventeen types of singular points for reducible real quartic curves. This classification is originally due to D.A. Gudkov. There are nine types of singular…

Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…

We determine all modular curves $X_0(N)$ with density degree $5$, i.e. all curves $X_0(N)$ with infinitely many points of degree $5$ and only finitely many points of degree $d\leq4$. As a consequence, the problem of determining all curves…

A set of nodes is called $n$-independent if each its node has a fundamental polynomial of degree $n.$ We proved in a previous paper [H. Hakopian and S. Toroyan, On the minimal number of nodes determining uniquelly algebraic curves, accepted…

We propose a notion of distance between two parametrized planar curves, called their discrepancy, and defined intuitively as the minimal amount of deformation needed to deform the source curve into the target curve. A precise definition of…

The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…

There is a conjecture, that the torsionfreeness of the module of differentials in a point of an algebraic or algebroid curve should imply that the curve is non singular at that point. A report on the main results is given.

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…

A result of Keel and McKernan states that a hypothetical counterexample to the F-conjecture must come from rigid curves on $\bar {M}_{0,n}$ that intersect the interior. We exhibit several ways of constructing rigid curves. In all our…

We establish sharp lower and upper bounds for the number of integral points near dilations of a space curve with nowhere vanishing torsion.

We investigate the problem of reconstructing a set $P\subseteq \mathbb{R}$ of distinct points, where the only information available about $P$ consists of the distances between some of the pairs of points. More precisely, we examine which…

For the given regular plane polygon and an arbitrary point in the plane of the polygon, the distances from the point to the vertices of the polygon are defined. We proved that there is one more non-congruent regular polygon having the…