Related papers: Distances and intersections of curves
We study the statistical convergence of metric valued sequences and of their subsequences. The interplay between the statistical and usual convergences in metric spaces is also studied.
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
A tropical complete intersection curve C in R^(n+1) is a transversal intersection of n smooth tropical hypersurfaces. We give a formula for the number of vertices of C given by the degrees of the tropical hypersurfaces. We also compute the…
We establish an arithmetic intersection theory in the framework of Arakelov geometry over adelic curves. To each projective scheme over an adelic curve, we associate a multi-homogenous form on the group of adelic Cartier divisors, which can…
We define and study graphs associated to hexagon decompositions of surfaces by curves and arcs. One of the variants is shown to be quasi-isometric to the pants graph, whereas the other variant is quasi-isometric to (a Cayley graph of) the…
The notion of an unexpected curve in the plane was introduced in 2018, and was quickly generalized in several directions in a flurry of mathematical activity by many authors. In this expository paper we first describe some of the main…
One of the goals of this paper is to prove that the index of intersection of two complex curves in a two-dimensional complex manifold tangent to each other at a common boundary point is positive. This is achieved via the construction of a…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
In this paper we are concerned with the existence of invariant curves of planar mappings which are quasi-periodic in the spatial variable, satisfy the intersection property, $\mathcal{C}^{p}$ smooth with $p>2n+1$, $n$ is the number of…
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…
From the perspective of Morse theory, it is natural to investigate gradient flow trajectories between critical points. In this short note, we explore the minimal hypersurface analogue of this phenomenon and present examples that suggest…
The purpose of this note is twofold. First, we survey results on the construction of large class groups of number fields by specialization of finite covers of curves. Then we give examples of applications of these techniques.
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve have attracted much interest. In the present paper, we propose a new method to construct a surface…
Data are often represented as graphs. Many common tasks in data science are based on distances between entities. While some data science methodologies natively take graphs as their input, there are many more that take their input in…
In this note, we investigate the maximal number of intersection points of a line with the contour of hypersurface amoebas in $\mathbb{R}^n$. We define the latter number to be the $\mathbb{R}$-degree of the contour. We also investigate the…
Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…