Related papers: Distances and intersections of curves

Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…

We introduce the Frenet theory of curves in dual space $\d^3$. After defining the curvature and the torsion of a curve, we classify all curves in dual plane with constant curvature. We also establish the fundamental theorem of existence in…

The connection between curvature and topology is a very well-studied theme in the subject of differential geometry. By suitably defining curvature on networks, the study of this theme has been extended into the domain of network analysis as…

Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…

For every finite collection of curves on a surface, we define an associated (semi-)norm on the first homology group of the surface. The unit ball of the dual norm is the convex hull of its integer points. We give an interpretation of these…

A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…

Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…

Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…

We study intersections of exceptional curves on del Pezzo surfaces of degree 1, motivated by questions in arithmetic geometry. Outside characteristics 2 and 3, at most 10 exceptional curves can intersect in a point. We classify the…

We study the arithmetic of complete intersections in projective space over number fields. Our main results include arithmetic Torelli theorems and versions of the Shafarevich conjecture, as proved for curves and abelian varieties by…

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…

In this paper, we establish a second main theorem for holomorphic curve intersecting hypersurfaces in general position in projective space with level of truncation. As an application, we reduce the number hypersurfaces in uniqueness problem…

Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…

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

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

We study Severi curves parametrizing rational bisections of elliptic fibrations associated to general pencils of plane cubics. Our main results show that these Severi curves are connected and reduced, and we give an upper bound on their…

We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…

Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…