Related papers: Complexity of planar and spherical curves

The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…

Given a regular $n$-gon on the plane, it is evident that from any point on the plane, taken as a center, one can draw $n$ concentric circles such that each circle passes through one of the vertices of the polygon. Naturally, this raises the…

We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.

We prove that pseudoholomorphic curves intersect complex 2-cycles positively in almost complex 4-manifolds. This makes possible a general and conceptually simple proof that an almost complex 4-manifold with many curves admits a taming…

We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space. Since not all curves have an embedding in the plane, we define the…

A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…

Let $ S $ be a hyperbolic surface. We investigate the topology of the space of all curves on $ S $ which start and end at given points in given directions, and whose curvatures are constrained to lie in a given interval $…

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 graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…

Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area-decreasing map…

We investigate the existence, and lack of unicity, of a holomorphic fibration by discs transversal to a rational curve in a complex surface.

A plane curve $C$ in $\mathbb{P}^2$ defined over $\mathbb{F}_q$ is called plane-filling if $C$ contains every $\mathbb{F}_q$-point of $\mathbb{P}^2$. Homma and Kim, building on the work of Tallini, proved that the minimum degree of a smooth…

By considering a spatial curve in a Euclidean space, we use its components, together with attaining a cyclic matrix, to show that this matrix is homothetic too and is in correspondence with a homothetic motion. Furthermore, if the curve…

Consider $n$ points evenly spaced on a circle, and a path of $n-1$ chords that uses each point once. There are $m=\lfloor n/2\rfloor$ possible chord lengths, so the path defines a multiset of $n-1$ elements drawn from $\{1,2,\ldots,m\}$.…

The genus of a maximal curve over a finite field with r^2 elements is either g_0=r(r-1)/2 or less than or equal to g_1=(r-1)^2/4. Maximal curves with genus g_0 or g_1 have been characterized up to isomorphism. A natural genus to be studied…

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

In this paper we compute the number of rational curves with one node passing through a given number of points, lines and tangent to a given number of planes in $\mathbb{P}^3$.

Let $E$ be a smooth cubic. A plane curve $D$ is said to be an $n$-contact curve to $E$ if the intersection multiplicities at each intersection point between $E$ and $D$ is $n$. In this note, we give an algorithm to produce $n$-contact…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.