Related papers: Intersections between the norm-trace curve and som…
We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…
We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…
We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
The defect of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…
We present an algorithm that computes the girth of the intersection graph of $n$ given line segments in the plane in $O(n^{1.483})$ expected time. This is the first such algorithm with $O(n^{3/2-\varepsilon})$ running time for a positive…
In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in…
This paper introduces the concept of Fractal Frenet equations, a set of differential equations used to describe the behavior of vectors along fractal curves. The study explores the analogue of arc length for fractal curves, providing a…
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…
This article contains a generalization of the authors' results on numbers of nodal points of eigenfunctions on "good curves" in analytic plane domains (arXiv:0710.0101). The term `good' means that the $L^2$ norms of restrictions of…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
This is a revision of some expository lecture notes written originally for a 5-hour minicourse on the intersection theory of punctured holomorphic curves and its applications in 3-dimensional contact topology. The main lectures are aimed…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We study the geometry, Hodge theory and derived category of cubic fourfolds containing several planes and their associated twisted K3 surfaces. We focus on the case of two planes intersecting along a line.
We address the problem of computing bounds for the self-intersection number (the minimum number of self-intersection points) of members of a free homotopy class of curves in the doubly-punctured plane as a function of their combinatorial…
The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing…