English
Related papers

Related papers: A Sylvester-Gallai theorem for cubic curves

200 papers

We consider elliptic curves whose coefficients are degree 2 polynomials in a variable t. We prove that for infinitely many values of t the resulting elliptic curve has rank at least 1. All such curves together form an algebraic surface…

Algebraic Geometry · Mathematics 2016-04-12 János Kollár , Massimiliano Mella

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

Metric Geometry · Mathematics 2023-02-09 Wiktor Mogilski , Kyle Grant

A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…

Combinatorics · Mathematics 2020-08-05 Edita Máčajová , Martin Škoviera

Let E be an elliptic curve over Q, and let n=>1. The central object of study of this article is the division field Q(E[n]) that results by adjoining to Q the coordinates of all n-torsion points on E(Q). In particular, we classify all curves…

Number Theory · Mathematics 2021-06-21 Enrique Gonzalez-Jimenez , Alvaro Lozano-Robledo

We consider elliptic curves defined by an equation of the form $y^2=x^3+f(t)$, where $f\in k[t]$ has coefficients in a perfect field $k$ of characteristic not $2$ or $3$. By performing $2$ and $3$-descent, we obtain, under suitable…

Algebraic Geometry · Mathematics 2024-01-15 Jean Gillibert , Emmanuel Hallouin , Aaron Levin

We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…

Discrete Mathematics · Computer Science 2022-03-11 Abhibhav Garg , Rafael Oliveira , Akash Sengupta

Although it is not known which groups can appear as torsion groups of elliptic curves over cubic number fields, it is known which groups can appear for infinitely many non-isomorphic curves. We denote the set of these groups as $S$. In this…

Number Theory · Mathematics 2011-11-24 Filip Najman

O. H. Keller conjectured in 1930 that in any tiling of $\Bbb R^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $n\le 6$. We show that for all $n\ge 10$ there exists a…

Metric Geometry · Mathematics 2016-09-06 Jeffrey C. Lagarias , Peter W. Shor

If $G$ and $H$ are two cubic graphs, then an $H$-coloring of $G$ is a proper edge-coloring $f$ with edges of $H$, such that for each vertex $x$ of $G$, there is a vertex $y$ of $H$ with $f(\partial_G(x))=\partial_H(y)$. If $G$ admits an…

Combinatorics · Mathematics 2018-07-26 Anush Hakobyan , Vahan Mkrtchyan

It is known on the Generalised Riemann Hypothesis that there are precisely $13$ cyclic cubic fields that are norm-Euclidean. Unconditionally, there is a gap between analytic estimates which hold for all sufficiently large conductors and…

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)$…

Number Theory · Mathematics 2022-03-18 Floris Vermeulen

This is a series of two papers in which we solve the Clemens conjecture: there are only finitely many smooth rational curves of each degree in a generic quintic threefold. In this first paper, we deal with a family of smooth Calabi-Yau…

Algebraic Geometry · Mathematics 2011-07-26 Bin Wang

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…

Metric Geometry · Mathematics 2014-02-25 Xiaomin Chen , Guangda Huzhang , Peihan Miao , Kuan Yang

We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…

Number Theory · Mathematics 2014-05-06 Wade Hindes

We give another version of Huang's proof that an induced subgraph of the n-dimensional cube graph containing over half the vertices has maximal degree at least $\sqrt{n}$, which implies the Sensitivity Conjecture. This argument uses…

Combinatorics · Mathematics 2019-09-04 Daniel V. Mathews

We study the $2$-Selmer ranks of elliptic curves. We prove that for an arbitrary elliptic curve $E$ over an arbitrary number field $K$, if the set $A_E$ of 2-Selmer ranks of quadratic twists of $E$ contains an integer $c$, it contains all…

Number Theory · Mathematics 2016-01-28 Myungjun Yu

We study the arithmetic of Galois-invariant sets of points on algebraic curves with controlled reduction behavior. Let $C$ be a smooth projective curve with a smooth proper model $\mathcal{C}$ over $\mathcal{O}_{K,S}$. We define $\Omega_n$…

Number Theory · Mathematics 2026-04-02 Fatemehzahra Janbazi , Fateme Sajadi

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…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Shpilrain , Jie-Tai Yu

A long-standing and well-known conjecture (see e.g. Caro, Discrete Math, 1994) states that every $n$-vertex graph $G$ without isolated vertices contains an induced subgraph where all vertices have an odd degree and whose order is linear in…

Combinatorics · Mathematics 2025-09-03 Jiangdong Ai , Qiwen Guo , Gregory Gutin , Yimin Hao , Anders Yeo

Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…