Related papers: Topological Designs
In this paper we consider models for genus one curves of degree n for n = 2, 3 and 4, which arise in explicit n-descent on elliptic curves. We prove theorems on the existence of minimal models with the same invariants as the minimal model…
A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G.…
We study the maximal values of Betti numbers of tropical subvarieties of a given dimension and degree in $\mathbb{TP}^n$. We provide a lower estimate for the maximal value of the top Betti number, which naturally depends on the dimension…
We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges. Graphs that admit such…
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 the second Gaussian map for a curve X of genus g, in relation with the second fundamental form of the period map. We exhibit a class of infinitely many curves with surjective second Gaussian map. We compute its rank on the…
We study the nef cone of self-products of a curve. When the curve is very general of genus $g>2$, we construct a nontrivial class of self-intersection 0 on the boundary of the nef cone. Up to symmetry, this is the only known nontrivial…
We prove upper bounds for the Morse index and number of intersections of min-max geodesics achieving the $p$-widths of a closed surface. A key tool in our analysis is a proof that for a generic set of metrics, the tangent cone at any vertex…
In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and with…
We construct a surface with irregularity $q=2,$ geometric genus $p_g=3,$ self-intersection of the canonical divisor $K^2=16$ and canonical map of degree $16.$
We extend the computations from our previous paper arXiv:2005.07054 to determine the maximum number of rational points on a curve over $\mathbb{F}_3$ and $\mathbb{F}_4$ with fixed gonality and small genus. We find, for example, that there…
This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…
A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We consider closed acylindrical surfaces in 3-manifolds and in knot and link complements, and show that the genus of these surfaces is bounded linearly by the number of tetrahedra in the triangulation of the manifold and by the number of…
Let K be a field and let L/K be a finite extension. Let X/K be a scheme of finite type. A point of X(L) is said to be new if it does not belong to the union of X(F), when F runs over all proper subextensions of L. Fix now an integer g>0 and…
We discuss the principle tools and results and state a few open problems concerning the classification and topology of plane sextics and trigonal curves in ruled surfaces.
The defect of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…
We give bounds on the primes of geometric bad reduction for curves of genus three of primitive CM type in terms of the CM orders. In the case of genus one, there are no primes of geometric bad reduction because CM elliptic curves are CM…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…