English
Related papers

Related papers: Orchards in elliptic curves over finite fields

200 papers

Consider the elliptic curves given by $ E_{n,\theta}:\quad y^2=x^3+2s n x^2-(r^2-s^2) n^2 x $ where $0 < \theta< \pi$, $\cos(\theta)=s/r$ is rational with $0\leq |s| <r$ and $\gcd (r,s)=1$. These elliptic curves are related to the…

Number Theory · Mathematics 2014-12-16 Ali S. Janfada , Sajad Salami , andrej Dujella , Juan C. Peral

Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathscr{F}$ as a subgraph. The Tur\'an number, denoted by $ex(n, \mathscr{F})$, is the maximum number of edges in an $n$-vertex…

Combinatorics · Mathematics 2025-07-16 Haixiang Zhang , Xiamiao Zhao , Mei Lu

A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…

Algebraic Geometry · Mathematics 2015-04-17 Satoru Fukasawa

We prove the sharp upper bound of at most $52$ lines on a complex K3-surface of degree four with a non-empty singular locus. We also classify the configurations of more than $48$ lines on smooth complex quartics.

Algebraic Geometry · Mathematics 2025-05-19 Alex Degtyarev , Sławomir Rams

We study the finiteness of low degree points on certain modular curves and their Atkin--Lehner quotients, and, as an application, prove the modularity of elliptic curves over all but finitely many totally real fields of degree $5$. On the…

Number Theory · Mathematics 2022-10-18 Yasuhiro Ishitsuka , Tetsushi Ito , Sho Yoshikawa

Let $p$ be a prime and $K$ a number field of degree $p$. We count the number of elliptic curves, up to $\bar{K}$-isomorphism, having a prescribed property, where this property is either that the curve contains a fixed torsion group as a…

Number Theory · Mathematics 2014-02-27 Filip Najman

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

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

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Computational Geometry · Computer Science 2017-08-22 Sergey Bereg , Matias Korman , Rodrigo I. Silveira , Ferran Hurtado , Dolores Lara , Jorge Urrutia , Mikio Kano , Carlos Seara , Kevin Verbeek

Let $\mathcal{F}$ be a family of graphs. The Tur\'{a}n number $ex(n;\mathcal{F})$ is defined to be the maximum number of edges in a graph of order $n$ that is $\mathcal{F}$-free. In 1959, Erd\H{o}s and Gallai determined the Tur\'an number…

Combinatorics · Mathematics 2020-04-10 Bo Ning , Jian Wang

We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and…

Combinatorics · Mathematics 2018-03-28 Blondin Massé Alexandre , de Carufel Julien , Goupil Alain

The study of the mapping class group of the plane minus a Cantor set uses a graph of loops, which is an analogous of the curve graph in the study of mapping class groups of compact surfaces. The Gromov boundary of this loop graph can be…

Geometric Topology · Mathematics 2021-06-04 Juliette Bavard

Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum…

Computational Geometry · Computer Science 2009-06-03 Haim Kaplan , Micha Sharir , Eugenii Shustin

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

Algebraic Geometry · Mathematics 2024-02-27 Larry Guth , Joshua Zahl

The capacitated tree cover problem with edge loads is a variant of the tree cover problem, where we are given facility opening costs, edge costs and loads, as well as vertex loads. We try to find a tree cover of minimum cost such that the…

Data Structures and Algorithms · Computer Science 2024-04-17 Benjamin Rockel-Wolff

We use class field theory to search for curves with many rational points over small finite fields. By going through abelian covers of curves of small genus we find a number of new curves. In particular, we settle the question of how many…

Number Theory · Mathematics 2014-03-12 Karl Rökaeus

A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimization goal is to determine the queue number of a graph, i.e.,…

Data Structures and Algorithms · Computer Science 2021-08-06 Michael A. Bekos , Martin Gronemann , Chrysanthi N. Raftopoulou

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

Combinatorics · Mathematics 2022-06-03 Jonathan Tidor , Hung-Hsun Hans Yu , Yufei Zhao

Bachet elliptic curves are the curves y^2=x^3+a^3 and in this work the group structure E(F_{p}) of these curves over finite fields F_{p} is considered. It is shown that there are two possible structures E(F_{p}){\cong}C_{p+1} or…

Number Theory · Mathematics 2011-06-30 Nazli Yildiz Ikikardes , Musa Demirci , Gokhan Soydan , Ismail Naci Cangul

We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \equiv 1$ or $4 \pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the…

Combinatorics · Mathematics 2019-05-30 Yanxun Chang , Peter J. Dukes , Tao Feng