English
Related papers

Related papers: The Hasse principle for lines on diagonal surfaces

200 papers

The Cayley--Salmon theorem implies the existence of a 27-sheeted covering space specifying lines contained in smooth cubic surfaces over $\mathbb{C}$. In this paper we compute the rational cohomology of the total space of this cover, using…

Algebraic Geometry · Mathematics 2021-01-05 Ronno Das

Surfaces of general type with canonical map of degree d bigger than 8 have bounded geometric genus and irregularity. In particular the irregularity is at most 2 if d>= 10. In the present paper, the existence of surfaces with d=10 and all…

Algebraic Geometry · Mathematics 2023-06-26 Nguyen Bin

In this paper, we study the Hasse norm principle for some non-Galois extensions of number fields. Our main theorem is that for any square-free composite number $d$ which is divisible by at least one of $3$, $55$, $91$ or $95$, there exists…

Number Theory · Mathematics 2025-04-30 Yasuhiro Oki

We classify the number of $k$-rational lines and conic fibrations on del Pezzo surfaces over a field $k$ in terms of relatively minimal surfaces and establish rational curve analogues of the inverse Galois problem for del Pezzo surfaces. We…

Algebraic Geometry · Mathematics 2025-11-13 Enis Kaya , Stephen McKean , Sam Streeter , H. Uppal

In 1975, Erd\H{o}s asked the following natural question: What is the maximum number of edges that an $n$-vertex graph can have without containing a cycle with all diagonals? Erd\H{o}s observed that the upper bound $O(n^{5/3})$ holds since…

Combinatorics · Mathematics 2023-08-31 Domagoj Bradač , Abhishek Methuku , Benny Sudakov

Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of…

We describe a method to show that certain elliptic surfaces do not admit purely inseparable multisections (equivalently, that genus one curves over function fields admit no points over the perfect closure of the base field) and use it to…

Algebraic Geometry · Mathematics 2021-12-07 Daniel Bragg , Max Lieblich

Let $(S,H)$ be a general primitively polarized $K3$ surface of genus $\p$ and let $p_a(nH)$ be the arithmetic genus of $nH.$ We prove the existence in $|\mathcal O_S(nH)|$ of curves with a triple point and $A_k$-singularities. In…

Algebraic Geometry · Mathematics 2012-09-05 Concettina Galati

We estimate the number of lines on a non-K3 quartic surface. Such a surface with only isolated double point(s) contains at most twenty lines; this bound is attained by a unique configuration of lines and by a surface with a certain limited…

Algebraic Geometry · Mathematics 2025-07-01 Alex Degtyarev , Sławomir Rams

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

Computational Geometry · Computer Science 2026-03-26 Matthias Bentert , Fedor v. Fomin , Petr A. Golovach , Souvik Saha , Sanjay Seetharaman , Kirill Simonov , Anannya Upasana

In 1973, Brown, Erd\H{o}s and S\'os proved that if $\mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $\mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible…

Combinatorics · Mathematics 2020-10-15 Andrey Kupavskii , Alexandr Polyanskii , István Tomon , Dmitriy Zakharov

We investigate the Hasse principle for complete intersections cut out by a quadric and cubic hypersurface defined over the rational numbers.

Number Theory · Mathematics 2014-06-11 T. D. Browning , R. Dietmann , D. R. Heath-Brown

Using degeneration to scrolls, we give an easy proof of non-existence of curves of low genera on general surfaces in P3 of degree d >=5. We show, along the same lines, boundedness of families of curves of small enough genera on general…

Algebraic Geometry · Mathematics 2011-03-16 Ciro Ciliberto , Mikhail Zaidenberg

We prove that the sweeping components of the space of smooth rational curves in a smooth hypersurface of degree $d$ in $P^n$ are not uniruled if $(n+1)/2 \leq d \leq n-3$. We also show that for any positive integer $e$, the space of smooth…

Algebraic Geometry · Mathematics 2009-08-28 Roya Beheshti

Over an algebraically closed field k, there are 16 lines on a degree 4 del Pezzo surface, but for other fields the situation is more subtle. In order to improve enumerative results over perfect fields, Kass and Wickelgren introduce a method…

Algebraic Geometry · Mathematics 2022-05-10 Cameron Darwin

In this paper, we study the properties of weak approximation with Brauer-Manin obstruction and the Hasse principle with Brauer-Manin obstruction for surfaces with respect to field extensions of number fields. We assume a conjecture of M.…

Number Theory · Mathematics 2021-04-15 Han Wu

Smooth complex surfaces polarized with an ample and globally generated line bundle of degree three and four, such that the adjoint bundle is not globally generated, are considered. Scrolls of a vector bundle over a smooth curve are shown to…

Algebraic Geometry · Mathematics 2007-05-23 Gian Mario Besana , Sandra Di Rocco

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

The Erd\H{o}s--Gallai Theorem states that for $k \geq 3$, any $n$-vertex graph with no cycle of length at least $k$ has at most $\frac{1}{2}(k-1)(n-1)$ edges. A stronger version of the Erd\H{o}s--Gallai Theorem was given by Kopylov: If $G$…

Combinatorics · Mathematics 2017-04-11 Zoltán Füredi , Alexandr Kostochka , Ruth Luo , Jacques Verstraëte

We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…

Combinatorics · Mathematics 2010-11-13 Balázs Keszegh , János Pach , Dömötör Pálvölgyi