Related papers: Crossing number of curves on surfaces
We show that the asymptotic growth rate for the minimal cardinality of a set of simple closed curves on a closed surface of genus $g$ which fill and pairwise intersect at most $K\ge 1$ times is $2\sqrt{g}/\sqrt{K}$ as $g \to \infty$ . We…
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
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…
In this article we give an upper bound for the number of cusps on a cuspidal curve on a Hirzebruch surface. We adapt the results that have been found for a similar question asked for cuspidal curves on the projective plane, and restate the…
A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$…
A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise…
We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…
We study the following question: fix a sufficient general curve D of degree d in P^2, what is the least number of intersections between D and an irreducible curve of degree m? G. Xu proved this number i(d, m) is at least d - 2 for all m.…
We establish a curvature estimate for classical minimal surfaces with total boundary curvature less than 4\pi. The main application is a bound on the genus of these surfaces depending solely on the geometry of the boundary curve. We also…
We study collections of curves in generic position on a closed surface whose complement consists of one disk only, up to orientation-preserving homeomorphism of the surface. We define a surgery operation on the set of such collections and…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
In this paper, we establish a second main theorem for holomorphic curve intersecting hypersurfaces in general position in projective space with level of truncation. As an application, we reduce the number hypersurfaces in uniqueness problem…
The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\times P_2$, $K_n\times P_3$ and $K_n\times C_4$.
The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and…
An $n$-Venn diagram is a diagram in the plane consisting of $n$ simple closed curves that intersect only finitely many times such that each of the $2^n$ possible intersections is represented by a single connected region. An $n$-Venn diagram…
We describe a search for plane-filling curves traversing all edges of a grid once. The curves are given by Lindenmayer systems with only one non-constant letter. All such curves for small orders on three grids have been found. For all…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…
We study geometric properties of linear strata of uni-singular curves. The singularities of closures of the strata are resolved and the resolutions are represent as projective bundles. This enables to study their geometry. In particular we…
This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…