English
Related papers

Related papers: An Improvement on the Hasse-Weil Bound and applica…

200 papers

The corresponding Hasse-Weil bound was a major breakthrough in history of mathematics. It has found many applications in mathematics, coding theory and theoretical computer science. In general, the Hasse-Weil bound is tight and cannot be…

Number Theory · Mathematics 2021-05-11 Liming Ma , Chaoping Xing

The Hasse-Weil-Serre bound is improved for curves of low genera over finite fields with discriminant in {-3,-4,-7,-8,-11,-19} by studying optimal curves.

Algebraic Geometry · Mathematics 2011-09-01 Alexey Zaytsev

We use the Aubry-Perret bound for singular curves, a generalization of the Hasse-Weil bound, to prove the following curious result about rational functions over finite fields: Let $f(X),g(X)\in\Bbb F_q(X)\setminus\{0\}$ be such that $q$ is…

Number Theory · Mathematics 2019-06-25 Xiang-dong Hou , Annamaria Iezzi

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

Information Theory · Computer Science 2021-12-14 Yansheng Wu , Yoonjin Lee , Qiang Wang

Weil's theorem gives the most standard bound on the number of points of a curve over a finite field. This bound was improved by Ihara and Oesterl\'e for larger genus. Recently, Hallouin and Perret gave a new point of view on these bounds,…

Number Theory · Mathematics 2025-06-06 Emmanuel Hallouin , Philippe Moustrou , Marc Perret

Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…

Algebraic Geometry · Mathematics 2007-05-23 Kristin Lauter , Jean-Pierre Serre

We find that non-hyperelliptic generalised Howe curves and their twists of genus 5 attain the Hasse-Weil-Serre bound over some finite fields of order p, p^2 or p^3 for a prime p. We are able to decompose their Jacobians completely under…

Algebraic Geometry · Mathematics 2024-12-05 Motoko Qiu Kawakita

Using an explicit family of plane quartic curves, we prove the existence of a genus 3 curve over any finite field of characteristic 3 whose number of rational points stays within a fixed distance from the Hasse-Weil-Serre upper bound. We…

Number Theory · Mathematics 2007-05-23 Roland Auer , Jaap Top

It is known that for a smooth hyperelliptic curve to have a large $a$-number, the genus must be small relative to the characteristic of the field, $p>0$, over which the curve is defined. It was proven by Elkin that for a genus $g$…

Number Theory · Mathematics 2017-06-28 Sarah Frei

Let $f$ be the $\mathbb{F}_q$-linear map over $\mathbb{F}_{q^{2n}}$ defined by $x\mapsto x+ax^{q^s}+bx^{q^{n+s}}$ with $\gcd(n,s)=1$. It is known that the kernel of $f$ has dimension at most $2$, as proved by Csajb\'ok et al. in "A new…

Combinatorics · Mathematics 2020-04-23 Olga Polverino , Giovanni Zini , Ferdinando Zullo

Motivated by Xing's method [7], we show that there exist [n,k,d] linear Hermitian codes over F_{q^2} with k+d>=n-3 for all sufficiently large q. This improves the asymptotic bound of Algebraic-Geometry codes from Hermitian curves given in…

Algebraic Geometry · Mathematics 2007-09-14 Siman Yang

A curve attaining the Hasse-Weil bound is called a maximal curve. Usually classical error-correcting codes obtained from a maximal curve have good parameters. However, the quantum stabilizer codes obtained from such classical…

Information Theory · Computer Science 2013-11-13 Lingfei Jin

The Gilbert--Varshamov (GV) bound is a central benchmark in coding theory, establishing existential guarantees for error-correcting codes and serving as a baseline for both Hamming and quantum fault-tolerant information processing. Despite…

Information Theory · Computer Science 2026-01-27 Chen Yuan , Ruiqi Zhu

We prove some improvements of the classical Weil bound for one variable additive and multiplicative character sums associated to a polynomial over a finite field $k=\Fq$ for two classes of polynomials which are invariant under a large…

Number Theory · Mathematics 2010-10-04 Antonio Rojas-León

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

Algebraic Geometry · Mathematics 2010-03-25 Claus Scheiderer

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

Let $X$ be a (projective, geometrically irreducible, nonsingular) algebraic curve of genus $g \ge 2$ defined over an algebraically closed field $K$ of odd characteristic $p$. Let $Aut(X)$ be the group of all automorphisms of $X$ which fix…

Algebraic Geometry · Mathematics 2018-05-16 Massimo Giulietti , Gabor Korchmaros

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

Number Theory · Mathematics 2019-02-20 Chantal David , Ethan Smith

Rational algebraic curves have been intensively studied in the last decades, both from the theoretical and applied point of view. In applications (e.g. level curves, linear homotopy deformation, geometric constructions in computer aided…

Algebraic Geometry · Mathematics 2024-08-14 Sebastian Falkensteiner , Rafael Sendra

We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method…

Information Theory · Computer Science 2013-07-25 Olav Geil , Stefano Martin
‹ Prev 1 2 3 10 Next ›