English
Related papers

Related papers: The Degree Complexity of Smooth Surfaces of codime…

200 papers

For a smooth projective curve, we derive a closed formula for the generating series of its Gromov--Witten invariants in genus $g$ and degree zero. It is known that the calculation of these invariants can be reduced to that of the…

Algebraic Geometry · Mathematics 2023-08-31 Di Yang

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

This paper studies the complexity of projected gradient descent methods for a class of strongly convex constrained optimization problems where the objective function is expressed as a summation of $m$ component functions, each possessing a…

Optimization and Control · Mathematics 2026-02-10 Xiaojun Chen , C. T. Kelley , Lei Wang

Let $X$ be a semistable curve and $L$ a line bundle whose multidegree is uniform, i.e., in the range between those of the structure sheaf and the dualizing sheaf of $X$. We establish an upper bound for $h^0(X,L)$, which generalizes the…

Algebraic Geometry · Mathematics 2022-11-02 Karl Christ

For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…

Geometric Topology · Mathematics 2015-06-08 Daryl Cooper , Stephan Tillmann

We prove that a smooth projective surface of degree $d$ in $\mathbb P^3$ contains at most $d^2(d^2-3d+3)$ lines. We characterize the surfaces containing exactly $d^2(d^2-3d+3)$ lines: these occur only in prime characterize $p$ and, up to…

Algebraic Geometry · Mathematics 2024-06-26 Janet Page , Tim Ryan , Karen E. Smith

We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the…

General Relativity and Quantum Cosmology · Physics 2026-01-07 Ali H. Chamseddine , Ola Malaeb , Sara Najem

We continue the work of Braun and Floystad, and Cook bounding the degree of smooth surfaces in P4 not of general type using generic initial ideal theory.

alg-geom · Mathematics 2008-02-03 R. Braun , M. Cook

The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…

Discrete Mathematics · Computer Science 2025-02-28 Jan Bok , Jiří Fiala , Nikola Jedličková , Jan Kratochvíl , Micheala Seifrtová

Let $C\subset \bold P^r$ be an integral projective curve. One defines the speciality index $e(C)$ of $C$ as the maximal integer $t$ such that $h^0(C,\omega_C(-t))>0$, where $\omega_C$ denotes the dualizing sheaf of $C$. Extending a…

Algebraic Geometry · Mathematics 2007-05-23 Vincenzo Di Gennaro , Davide Franco

We consider a plane polynomial vector field $P(x,y)dx+Q(x,y)dy$ of degree $m>1$. To each algebraic invariant curve of such a field we associate a compact Riemann surface with the meromorphic differential $\omega=dx/P=dy/Q$. The asymptotic…

Dynamical Systems · Mathematics 2009-10-31 Alexei Tsygvintsev

It is proved that a smooth rational surface in projective four-space, which is ruled by cubics or quartics has degree at most 12. It is also proved that a smooth rational surface in projective four-space which is the image of Fn by a linear…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Ellia

In this paper we present a way of computing the degree of the secant (resp., tangent) variety of a smooth projective surface, under the assumption that the divisor giving the embedding in the projective space is $3$-very ample. This method…

Algebraic Geometry · Mathematics 2019-06-10 Andrea Cattaneo

Francesco Severi showed that equisingular families of plane nodal curves are T-smooth, i.e. smooth of the expected dimension, whenever they are non-empty. For families with more complicated singularities this is no longer true. Given a…

Algebraic Geometry · Mathematics 2009-07-28 Thomas Keilen

For Arithmetization-Oriented ciphers and hash functions Gr\"obner basis attacks are generally considered as the most competitive attack vector. Unfortunately, the complexity of Gr\"obner basis algorithms is only understood for special…

Cryptography and Security · Computer Science 2024-03-05 Matthias Johann Steiner

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

Computational Complexity · Computer Science 2012-01-18 Sepp Hartung , André Nichterlein

We study ramified covers of the projective plane. Given a smooth projective surface S and a generic enough projection of S to the projective plane, we get a cover of the plane ramified over a plane curve. The branch curve is usually…

Algebraic Geometry · Mathematics 2010-08-03 Michael Friedman , Maxim Leyenson

We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves $S^1 \to R^2$. They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em…

Geometric Topology · Mathematics 2014-07-29 Victor A. Vassiliev

Ellingsrud and Peskine (1989) proved that there exists a bound on the degree of smooth non general type surfaces in P^4. The latest proven bound is 52 by Decker and Schreyer in 2000. In this paper we consider bounds on the degree of a…

Algebraic Geometry · Mathematics 2009-10-29 L. V. Rammea , G. K. Sankaran

We prove that the determinantal complexity of a hypersurface of degree $d > 2$ is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least $5$. As a result, we obtain that the…

Computational Complexity · Computer Science 2015-05-12 Jarod Alper , Tristram Bogart , Mauricio Velasco