Related papers: Newton polygons and curve gonalities

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

In a previous paper, we proved that over a finite field $k$ of sufficiently large cardinality, all curves of genus at most 3 over k can be modeled by a bivariate Laurent polynomial that is nondegenerate with respect to its Newton polytope.…

In this paper we compute the gonality over Q of the modular curve X1(N) for all N <= 40 and give upper bounds for each N <= 250. This allows us to determine all N for which X1(N) has infinitely points of degree <= 8. We conjecture that the…

We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…

The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…

Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…

We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unlike the treewidth, the scramble number is not minor monotone,…

We extend Quine's bound on the number of self-intersection of curves with polynomial parameterization to the case of Laurent polynomials. As an application, we show that circle embeddings are dense among all maps from a circle to a plane…

We study the complexity of birational self-maps of a projective threefold $X$ by looking at the birational type of surfaces contracted. These surfaces are birational to the product of the projective line with a smooth projective curve. We…

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

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…

Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with…

The purpose of this paper is to show that for a complete intersection curve $C$ in projective space (other than a few stated exceptions), any morphism $f: C \to \mathbb{P}^r$ satisfying $\text{deg}\, f^*\mathcal{O}_{\mathbb{P}^r}(1)…

Let $p$ be an odd prime. What are the possible Newton polygons for a curve in characteristic $p$? Equivalently, which Newton strata intersect the Torelli locus in $\mathcal{A}_g$? In this note, we study the Newton polygons of certain curves…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…

A widely believed conjecture predicts that curves of bounded geometric genus lying on a variety of general type form a bounded family. One may even ask whether the canonical degree of a curve $C$ in a variety of general type is bounded from…