Related papers: Crossing number of curves on surfaces
We consider flat families of reduced curves on a smooth surface S such that each member C has the same number of singularities of fixed singularity types and the corresponding (locally closed) subscheme H of the Hilbert scheme of S. We are…
Recent investigations on the bifurcations in switching circuits have shown that many atypical bifurcations can occur in piecewise smooth maps which can not be classified among the generic cases like saddle-node, pitchfork or Hopf…
Based on Nielsen fixed point theory and Gr\"{o}bner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.
Below we consider the evolutes of plane real-algebraic curves and discuss some of their complex and real-algebraic properties. In particular, for a given degree $d\ge 2$, we provide lower bounds for the following four numerical invariants:…
A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of the boundary of M. We derive a…
The crossing number of a graph $G$, ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing edges over all drawings of $G$. In this note we show that…
In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
We determine the maximum number of rational points on a curve over $\mathbb{F}_2$ with fixed gonality and small genus.
Given a plane curve $\gamma: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(\gamma)$ of inflections which curves $\mbox{diff}(\gamma)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms…
Given an edge-coloring of a simple graph, assign to every vertex $v$ a set $S_v$ comprised of the colors used on the edges incident to $v$. The $k$-intersection chromatic index of a graph is the minimum $t$ such that the edge set can be…
The average value of the number of intersection points of two plane curves given by trigonometrical polynomial maps of degree $N$ and bounded $L_2$- or $W_2^r$- norms is calculated
A curve \gamma in the plane is t-monotone if its interior has at most t-1 vertical tangent points. A family of t-monotone curves F is \emph{simple} if any two members intersect at most once. It is shown that if F is a simple family of n…
We estimate the number of lines on a non-K3 quartic surface. Such a surface with only isolated double point(s) contains at most twenty lines; this bound is attained by a unique configuration of lines and by a surface with a certain limited…
We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
We study curves on the product of two $K$-trivial surfaces. In the case of the product of two very general abelian surfaces $A_1\times A_2$, we prove that the minimal genus of a non-trivial curve on $A_1\times A_2$ is $6$.
Any quasi-isometry of the complex of curves is bounded distance from a simplicial automorphism. As a consequence, the quasi-isometry type of the curve complex determines the homeomorphism type of the surface.
We report on the computation of the integral homology of the mapping class group of genus g surfaces with one boundary curve and m punctures, when 2g + m is smaller than 6. In particular, it includes the genus 2 case with no or one…
A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).