Related papers: Distances and intersections of curves
Near a singular point of a surface or a curve, geometric invariants diverge in general, and the orders of diverge, in particular the boundedness about these invariants represent geometry of the surface and the curve. In this paper, we study…
On a smooth variety, Serre's intersection formula computes intersection multiplicities via an alternating sum of the lengths of Tor groups. When the variety is singular, the corresponding sum can be a divergent series. But there are…
Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…
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…
On a general hypersurface of degree $d\leq n$ in $\mathbb P^n$ or $\mathbb P^n$ itself, we prove the existence of curves of any genus and high enough degree depending on the genus passing through the expected number $t$ of general points or…
In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We introduce one dimensional sets to help describe and constrain the integral curves of an $n$ dimensional dynamical system. These curves provide more information about the system than the zero-dimensional sets (fixed points) do. In fact,…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
We prove that any arithmetically Gorenstein curve on a smooth, general hypersurface $X\subset \bbP^{4}$ of degree at least 6, is a complete intersection. This gives a characterisation of complete intersection curves on general type…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
We study curves consisting of unions of projective lines whose intersections are given by graphs. Under suitable hypotheses on the graph, these so-called \emph{graph curves} can be embedded in projective space as line arrangements. We…
In this paper we survey several intersection and non-intersection phenomena appearing in the realm of symplectic topology. We discuss their implications and finally outline some new relations of the subject to algebraic geometry.
The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree,…
The quantum cohomology algebra of a projective manifold X is the cohomology H(X,Q) endowed with a different algebra structure, which takes into account the geometry of rational curves in X. We show that this algebra takes a remarkably…
We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For…
The characteristic numbers of smooth plane quartics are computed using intersection theory on a component of the moduli space of stable maps. This completes the verification of Zeuthen's prediction of characteristic numbers of smooth plane…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
In approximation theory classical discrete operators, like generalized sampling, Sz\'{a}sz-Mirak'jan, Baskakov and Bernstein operators, have been extensively studied for scalar functions. In this paper, we look at the approximation of…
If we are given a connected finite graph $G$ and a subset of its vertices $V_{0}$, we define a distance-residual graph as a graph induced on the set of vertices that have the maximal distance from $V_{0}$. Some properties and examples of…