Related papers: Curves on surfaces with prescribed pairwise inters…
We study the existence of Artin-Schreier curves with large $ a$-number. We also give bounds on the $a$-number of trigonal curves of genus $5$ in small characteristic.
We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…
We initiate the study of computing shortest non-separating simple closed curves with some given topological properties on non-orientable surfaces. While, for orientable surfaces, any two non-separating simple closed curves are related by a…
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…
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections 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 investigate properties of sparse and tight surface graphs. In particular we derive topological inductive constructions for $(2, 2)$-tight surface graphs in the case of the sphere, the plane, the twice punctured sphere and the torus. In…
A very general surface of degree at least four in projective space of dimension three contains no curves other than intersections with surfaces. We find a formula for the degree of the locus of surfaces of degree at least five which contain…
For each $1\leq n\leq6$ we present formulas for the number of $n-$nodal curves in an $n-$dimensional linear system on a smooth, projective surface. This yields in particular the numbers of rational curves in the system of hyperplane…
Beineke, Harary and Ringel discovered a formula for the minimum genus of a torus in which the $n$-dimensional hypercube graph can be embedded. We give a new proof of the formula by building this surface as a union of certain faces in the…
Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…
We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…
Let $S_g$ denoting the genus $g$ closed orientable surface. An {\em origami} (or flat structure) on $S_g$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom…
We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic…
We prove that some Gromov-Witten numbers associated to rational contact (Legendrian) curves in any contact complex projective space with arbitrary incidence conditions are enumerative. Also, we use Bott formula on the Kontsevich space to…
Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…
We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four,…
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$.