English
Related papers

Related papers: An effective bound for the gonality conjecture

200 papers

An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…

Combinatorics · Mathematics 2014-03-19 Florent Foucaud , Sylvain Gravier , Reza Naserasr , Aline Parreau , Petru Valicov

Let $G$ be a finite, connected graph. The eccentricity of a vertex $v$ of $G$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the arithmetic mean of the eccentricities of the vertices of $G$. We…

Combinatorics · Mathematics 2020-05-01 Alex Alochukwu , Peter Dankelmann

We obtain a complete description of the effective cone of $C_{g-2}$ when $C$ is a general curve of genus $g \geq 6,$ as well as a new bound in the case where $C$ is a smooth plane quintic. In addition, we obtain a new virtual bound for the…

Algebraic Geometry · Mathematics 2010-05-24 Yusuf Mustopa

In this paper we obtain bounds on $h^0(E)$ where $E$ is a semistable bundle of rank 3 over a smooth irreducible projective curve $X$ of genus $g \geq 2$ defined over an algebraically closed field of characteristic 0. These bounds are…

Algebraic Geometry · Mathematics 2007-05-23 H. Lange , P. E. Newstead

In this paper we complete the study of the Lan-Sheng-Zuo conjecture proposed in arXiv:1210.8280 for the curve case. Precisely, we prove that every semistable Higgs bundle is strongly semistable for curves of genus $g\leq 1$, and over any…

Algebraic Geometry · Mathematics 2026-04-03 Bowen Liu , Mao Sheng

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

Combinatorics · Mathematics 2025-09-03 Michal Dvořák , Dušan Knop , Michal Opler , Jan Pokorný , Ondřej Suchý , Krisztina Szilágyi

Let C be an algebraic curve of genus g. Consider extensions E of a vector bundle F'' of rank n'' by a vector bundle F' of rank n'. The following statement was conjectured by Lange: If 0<n'deg F''-n''degF'\le n'n''(g-1), then there exist…

alg-geom · Mathematics 2008-02-03 Montserrat Teixidor-i-Bigas

In this paper, we study whether a given morphism $f$ from the tangent bundle of $\mathbb{P}^1$ to a balanced vector bundle of degree $(n+1)d$ is induced by the restriction of the tangent bundle $T_{\mathbb{P}^n}$ to a rational curve of…

Algebraic Geometry · Mathematics 2024-09-09 Chen Song

This paper is mainly concerned with applying the theory of M-regularity developed in the previous math.AG/0110003 to the study of linear series given by multiples of ample line bundles on abelian varieties. We define a new invariant of a…

Algebraic Geometry · Mathematics 2007-05-23 Giuseppe Pareschi , Mihnea Popa

We establish Green's syzygy conjecture for classes of covers of curves of higher Clifford dimension. These curves have an infinite number of minimal pencils, in particular they do not verify a well-known Brill-Noether theoretic sufficient…

Algebraic Geometry · Mathematics 2023-05-04 Marian Aprodu , Gavril Farkas

We prove that the linear syzygy spaces of a general canonical curve are spanned by syzygies of minimal rank.

Commutative Algebra · Mathematics 2024-01-31 Michael Kemeny

A symplectic or orthogonal bundle $V$ of rank $2n$ over a curve has an invariant $t(V)$ which measures the maximal degree of its isotropic subbundles of rank $n$. This invariant $t$ defines stratifications on moduli spaces of symplectic and…

Algebraic Geometry · Mathematics 2012-04-05 Insong Choe , George H. Hitching

The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…

Combinatorics · Mathematics 2025-12-15 Tapas Kumar Mishra

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

Combinatorics · Mathematics 2023-04-03 Benjamin Egan , Yuri Nikolayevsky

Green's conjecture is proved for smooth curves C lying on a rational surface S with an anticanonical pencil, under some mild hypotheses on the line bundle L defined by C. Constancy of Clifford dimension, Clifford index and gonality of…

Algebraic Geometry · Mathematics 2013-02-13 Margherita Lelli-Chiesa

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…

Metric Geometry · Mathematics 2014-04-08 Marcos Charalambides

P. Ellia and G.Sacchiero have shown that if $S$ is a smooth surface in $\Pn 4$ which is ruled in conics, then $S$ has degree 4 or 5. In this paper we give a proof of this result combining the ideas of Ellia and Sacchiero as they are used in…

alg-geom · Mathematics 2008-02-03 Robert Braun , Kristian Ranestad

Let $C$ be a general canonical curve of genus $g$ defined over an algebraically closed field of arbitrary characteristic. We prove that if $g \notin \{4,6\}$, then the normal bundle of $C$ is semistable. In particular, if $g \equiv 1$ or…

Algebraic Geometry · Mathematics 2023-06-12 Izzet Coskun , Eric Larson , Isabel Vogt

Consider a complex line bundle over a compact complex manifold equipped with an infinitely differentiable metric with strictly positive curvature form. Assign to positive tensor powers of this bundle the associated product metrics and…

Complex Variables · Mathematics 2013-08-27 Michael Christ

The logical depth of a graph $G$ is the minimum quantifier depth of a first order sentence defining $G$ up to isomorphism in the language of the adjacency and the equality relations. We consider the case that $G$ is a dissection of a convex…

Combinatorics · Mathematics 2007-05-23 Manuel Bodirsky , Mihyun Kang , Oleg Verbitsky