English
Related papers

Related papers: Counting Number Fields in Fibers

200 papers

We provide in this paper an upper bound for the number of rational points on a curve defined over a one variable function field over a finite field. The bound only depends on the curve and the field, but not on the Jacobian variety of the…

Number Theory · Mathematics 2015-02-09 Amilcar Pacheco , Fabien Pazuki

The number of rational points of a plane non-singular algebraic curve X defined over a finite field is computed, provided that the generic point of X is not an inflexion and that X is Frobenius non-classical with respect to conics.

Number Theory · Mathematics 2007-05-23 Massimo Giulietti

We study Grothendieck rings (in the sense of logic) of fields. We prove the triviality of the Grothendieck rings of certain fields by constructing definable bijections which imply the triviality. More precisely, we consider valued fields,…

Logic · Mathematics 2007-05-23 Raf Cluckers

This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…

Algebraic Geometry · Mathematics 2014-09-23 Gerard van der Geer

When do two irreducible polynomials with integer coefficients define the same number field? One can define an action of $\mathrm{GL}_2 \times \mathrm{GL}_1$ on the space of polynomials of degree $n$ so that for any two polynomials $f$ and…

We offer a $\forall\exists$-definition for (affine) Campana points over $\mathbb{P}^1_K$ (where $K$ is a number field), which constitute a set-theoretical filtration between $K$ and $\mathcal{O}_{K,S}$ ($S$-integers), which are well-known…

Number Theory · Mathematics 2025-04-15 Juan Pablo De Rasis

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

Algebraic Geometry · Mathematics 2019-11-07 Damian Rössler

Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…

Classical Analysis and ODEs · Mathematics 2017-08-03 Gal Binyamini

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

Number Theory · Mathematics 2015-06-26 Attila Berczes , Jan-Hendrik Evertse , Kalman Gyory

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

Number Theory · Mathematics 2022-05-02 Victor Bovdi , Adama Diene , Roman Popovych

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Number Theory · Mathematics 2020-02-27 Jeff Achter , Everett W. Howe

Given a smooth projective curve C defined over a number field and given two elliptic surfaces E_1/C and E_2/C along with sections P_i and Q_i of E_i (for i = 1,2), we prove that if there exist infinitely many algebraic points t on C such…

Number Theory · Mathematics 2017-03-07 Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

A strengthened version of Harborth's well-known conjecture -- known as Kleber's conjecture -- states that every planar graph admits a planar straight-line drawing where every edge has integer length and each vertex is restricted to the…

Computational Geometry · Computer Science 2025-09-05 Henry Förster , Stephen Kobourov , Jacob Miller , Johannes Zink

A number field $K$ is called primitive if $\mathbb Q$ and $K$ are the only subfields of $K$. Let $X$ be a nice curve over $\mathbb Q$ of genus $g$. A point $P$ of degree $d$ on $X$ is called primitive if the field of definition $\mathbb…

Number Theory · Mathematics 2024-11-12 Maarten Derickx

We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…

Number Theory · Mathematics 2007-05-23 Alan G. B. Lauder , Daqing Wan

We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…

Combinatorics · Mathematics 2021-03-26 Sergey Bereg , Brian Malouf , Linda Morales , Thomas Stanley , I. Hal Sudborough

Let $k$ be a number field and $K$ a finite extension of $k$. We count points of bounded height in projective space over the field $K$ generating the extension $K/k$. As the height gets large we derive asymptotic estimates with a…

Number Theory · Mathematics 2012-04-05 Martin Widmer

We describe algebraic curves $ X : F(x, y) = 0 $ defined over $\overline{\mathbb{Q}}$ that satisfy the following property: there exist a number field $k$ and an infinite set $S \subset k$ such that, for every $y \in S$, the roots of the…

Number Theory · Mathematics 2025-08-18 Fedor Pakovich

We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can…

Information Theory · Computer Science 2011-02-24 Rathinakumar Appuswamy , Massimo Franceschetti