English
Related papers

Related papers: Finite field elements of high order arising from m…

200 papers

We provide a recipe to construct towers of fields producing high order elements in $\mathrm{GF}(q,2^n)$, for odd $q$, and in $\mathrm{GF}(2,2 \cdot 3^n)$, for $n \ge 1$. These towers are obtained recursively by $x_{n}^2 + x_{n} = v(x_{n -…

Number Theory · Mathematics 2023-08-02 Valerio Dose , Pietro Mercuri , Ankan Pal , Claudio Stirpe

Elkies proposed a procedure for constructing explicit towers of curves, and gave two towers of Shimura curves as relevant examples. In this paper, we present a new explicit tower of Shimura curves constructed by using this procedure.

Number Theory · Mathematics 2017-01-27 Takehiro Hasegawa

We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}

Number Theory · Mathematics 2026-02-27 Roman Popovych

This paper concerns towers of curves over a finite field with many rational points, following Garcia--Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian…

Number Theory · Mathematics 2007-05-23 Peter Beelen , Irene I. Bouw

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

alg-geom · Mathematics 2007-05-23 Gerard van der Geer , Marcel van der Vlugt

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

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

Elaborating on ideas of Elkies, we show how recursive equations for towers of Drinfeld modular curves $(X_0(P^n))_{n\ge 0}$ for $P\in \mathbb F_q[T]$ can be read of directly from the modular polynomial $\Phi_P(X,Y)$ and how this naturally…

Number Theory · Mathematics 2011-10-28 Alp Bassa , Peter Beelen

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

Over all non-prime finite fields, we construct some recursive towers of function fields with many rational places. Thus we obtain a substantial improvement on all known lower bounds for Ihara's quantity $A(\ell)$, for $\ell = p^n$ with $p$…

Algebraic Geometry · Mathematics 2013-05-21 Alp Bassa , Peter Beelen , Arnaldo Garcia , Henning Stichtenoth

In 2000, based on his procedure for constructing explicit towers of modular curves, Elkies deduced explicit equations of rank-2 Drinfeld modular curves which coincide with the asymptotically optimal towers of curves constructed by Garcia…

Number Theory · Mathematics 2020-05-05 Rui Chen , Zhuo Chen , Chuangqiang Hu

We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X_0(l^n): n=1,2,3,...}. We illustrate the method by giving equations for eight towers with various geometric features. We conclude…

Number Theory · Mathematics 2007-07-16 Noam D. Elkies

We give a construction and equations for good recursive towers over any finite field $\mathbf{F}_q$ with $q \ne 2$ and $3$.

Algebraic Geometry · Mathematics 2018-07-17 Alp Bassa , Christophe Ritzenthaler

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

Number Theory · Mathematics 2021-03-30 Reinier Broker , Peter Stevenhagen

We construct finite element de~Rham complexes of higher and possibly non-uniform polynomial order in finite element exterior calculus (FEEC). Starting from the finite element differential complex of lowest-order, known as the complex of…

Numerical Analysis · Mathematics 2023-10-17 Martin Werner Licht

We show how the high order finite element spaces of differential forms due to Raviart-Thomas-N\'edelec-Hiptmair fit into the framework of finite element systems, in an elaboration of the finite element exterior calculus of…

Numerical Analysis · Mathematics 2014-07-01 Snorre Harald Christiansen , Francesca Rapetti

In this article we give an explicit construction of the moduli space of trigonal superelliptic curves with level 3 structure. The construction is given in terms of point sets on the projective line and leads to a closed formula for the…

Algebraic Geometry · Mathematics 2021-07-05 Olof Bergvall , Oliver Leigh

We push further the classical proof of Weil upper bound for the number of rational points of an absolutely irreducible smooth projective curve $X$ over a finite field in term of euclidean relationships between the Neron Severi classes in…

Number Theory · Mathematics 2014-09-09 Emmanuel Hallouin , Marc Perret

We investigate numerical solutions of high order curl problems with various formulations and finite elements. We show that several classical conforming finite elements lead to spurious solutions, while mixed formulations with finite…

Numerical Analysis · Mathematics 2021-11-12 Kaibo Hu , Qian Zhang , Jiayu Han , Lixiu Wang , Zhimin Zhang

Finite element de Rham complexes and finite element Stokes complexes with various smoothness in three dimensions are systematically constructed. First smooth scalar finite elements in three dimensions are derived through a non-overlapping…

Numerical Analysis · Mathematics 2022-06-22 Long Chen , Xuehai Huang
‹ Prev 1 2 3 10 Next ›