English
Related papers

Related papers: Orchards in elliptic curves over finite fields

200 papers

Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…

Algebraic Geometry · Mathematics 2023-06-01 Cameron Darwin , Aygul Galimova , Miao Pam Gu , Stephen McKean

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

Combinatorics · Mathematics 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood

Consider the elliptic curve $E$ given by the Weierstrass equation $y^2 = x^3 - 11x - 14$, which has complex multiplication by the order of conductor $2$ inside $\mathbb{Z}[i]$. It was recently observed in a paper of Daniels and…

Number Theory · Mathematics 2023-01-05 Nathan Jones

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

Optimization and Control · Mathematics 2026-05-18 Nefedov V. N

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

Algebraic Geometry · Mathematics 2023-06-22 Gal Binyamini

Given a set of $m$ points and a set of $n$ lines in the plane, we consider the problem of computing the faces of the arrangement of the lines that contain at least one point. In this paper, we present an $O(m^{2/3}n^{2/3}+(n+m)\log n)$ time…

Computational Geometry · Computer Science 2026-03-06 Haitao Wang

We prove the generalised Tate conjecture for H^3 of products of elliptic curves over finite fields, by slightly modifying an argument of M. Spiess concerning the Tate conjecture. We prove it fully if the elliptic curves run among at most 3…

Algebraic Geometry · Mathematics 2011-01-11 Bruno Kahn

We construct qualitatively new examples of superabundant tropical curves which are non-realizable in genus $3$ and $4$. These curves are in $\mathbb{R}^3$ and $\mathbb{R}^4$ respectively, and have properties resembling canonical embeddings…

Algebraic Geometry · Mathematics 2024-12-20 Sae Koyama

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

We produce an infinite family of imaginary quadratic fields whose ideal class groups have $3$-rank at least $2$.

Number Theory · Mathematics 2018-03-13 Kalyan Chakraborty , Azizul Hoque

Let K be a finite field. We know that a half of elements of K* is a square. So it is natural to ask how many of them appear as x-coordinate of points on an elliptic curve over K. We consider a specific class of elliptic curves over finite…

Number Theory · Mathematics 2010-01-05 Yu Tsumura

An out-tree $T$ of a directed graph $D$ is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By $l(D)$ and $l_s(D)$ we denote the maximum number of leaves over all out-trees and…

Data Structures and Algorithms · Computer Science 2008-12-18 Paul Bonsma , Frederic Dorn

In this paper, we construct infinitely many quadruples of real quadratic fields whose class numbers are all divisible by $3$. To the best of our knowledge, this is the first result towards the divisibility of the class numbers of certain…

Number Theory · Mathematics 2025-12-15 Kalyan Banerjee , Ankurjyoti Chutia , Azizul Hoque

The maximum number of non-crossing straight-line perfect matchings that a set of $n$ points in the plane can have is known to be $O(10.0438^n)$ and $\Omega^*(3^n)$. The lower bound, due to Garc\'ia, Noy, and Tejel (2000) is attained by the…

Computational Geometry · Computer Science 2017-11-20 Andrei Asinowski , Günter Rote

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the…

Combinatorics · Mathematics 2026-05-25 Jiechen Zhang

We show that given a collection of A lines in \R^n, n\geq 2, the maximum number of their joints (points incident to at least n lines whose directions form a linearly independent set) is O(A^{n/(n-1)}). An analogous result for smooth…

Combinatorics · Mathematics 2009-06-15 René Quilodrán

A hypergraph $H$ is said to be \emph{linear} if every pair of vertices lies in at most one hyperedge. Given a family $\mathcal{F}$ of $r$-uniform hypergraphs, an $r$-uniform hypergraph $H$ is \emph{$\mathcal{F}$-free} if it contains no…

Combinatorics · Mathematics 2026-04-14 Rajat Adak , Pragya Verma

Let C be an algebraic curve in a power of an elliptic curve, both defined over the algebraic numbers. We show that the set of algebraic points of C which satisfy certain conditions is a finite set. This result has implications with the…

Number Theory · Mathematics 2008-11-10 Viada Evelina

The $p$-group generation algorithm is used to verify that the Hilbert $3$-class field tower has length $3$ for certain imaginary quadratic fields $K$ with $3$-class group $\mathrm{Cl}_3(K) \cong [3,3]$. Our results provide the first…

Number Theory · Mathematics 2013-12-03 MIchael R. Bush , Daniel C. Mayer
‹ Prev 1 4 5 6 7 8 10 Next ›