Related papers: Newton polygons and curve gonalities

The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

In this paper we study Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve. We present an upper bound on the gonality of the Cartesian product of any two graphs, and…

We consider a variant of metrised graphs where the edge lengths take values in a commutative monoid, as a higher-rank generalisation of the notion of a tropical curve. Divisorial gonality, which Baker and Norine defined on combinatorial…

We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…

We study the minimal degrees and gonalities of curves on complete intersections. We prove a classical conjecture which asserts that the degree of any curve on a general complete intersection $X \subseteq \mathbb{P}^N$ cut out by polynomials…

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

We prove that for every polynomial ODE there exists a Carnot group where the trajectories of the ODE lift to abnormal curves. The proof defines an explicit construction to determine a covector for the resulting abnormal curves. Using this…

We study the problem of $d$-gonality of the modular curve $X_0(N)$. As a result, we can give an upperbound of the level $N$ by means of $d$. This generalizes Ogg's result on hyperelliptic modular curves ($d = 2$). As a corollary of this…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

We extend the Newton's method and show the extended Newton's method leads to the binomial expansion of Newton's method that the convergences become the quadratic and linearly. In case of the quadratic convergence, we give the convergence…

In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…

Given an integer $\gamma\geq 2$ and an odd prime power $q$ we show that for every large genus $g$ there exists a non-singular curve $C$ defined over $\mathbb{F}_q$ of genus $g$ and gonality $\gamma$ and with exactly $\gamma(q+1)$…

We study the gonality of curves $C$ over $\mathbb C$ whose normalization is composed of one or two copies of $\mathbb P^1$. In the first case, $C$ is a nodal curve with $g(C)$ nodes, and in the second case $C$ is a so-called binary curve.…

Cais, Ellenberg and Zureick-Brown recently observed that over finite fields of characteristic two, all sufficiently general smooth plane projective curves of a given odd degree admit a non-trivial rational 2-torsion point on their Jacobian.…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…