Related papers: Elliptic Gau{\ss} sums and Schoof's algorithm
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…
Given an elliptic curve E over a number field k, the Galois action on the torsion points of E induces a Galois representation, \rho_E : Gal(\bar{k}/k) \to GL_2(\hat{Z}). For a fixed number field k, we describe the image of \rho_E for a…
The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms-including Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS) multiplication, as well as…
In this paper we develop an $hp$-adaptive procedure for the numerical solution of general second-order semilinear elliptic boundary value problems, with possible singular perturbation. Our approach combines both adaptive Newton schemes and…
We consider natural polynomial truncations of hypergeometric power series defined over finite fields. For these truncations, we establish asymptotic upper bounds of order $O(p^{11/12})$ on the number of roots in the prime field…
We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…
Let $X$ be an elliptic curve or a ramifying hyperelliptic curve over $\mathbb F_q$. We will discuss how to factorize the coefficients of the exponential and logarithm series for a Hayes module over such a curve. This allows us to obtain…
This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…
The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…
This paper introduces a novel staggered discontinuous Galerkin (SDG) method tailored for solving elliptic equations on polytopal meshes. Our approach utilizes a primal-dual grid framework to ensure local conservation of fluxes,…
By adapting Feynman's sum over paths method to a quantum mechanical system whose phase space is a torus, a new proof of the Landsberg-Schaar identity for quadratic Gauss sums is given. In contrast to existing non-elementary proofs, which…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
We explicitly compute family GW invariants of elliptic surfaces for primitive classes. That involves establishing a TRR formula and a symplectic sum formula for elliptic surfaces and then determining the GW invariants using an argument from…
Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…
Near-optimal computational complexity of an adaptive stochastic Galerkin method with independently refined spatial meshes for elliptic partial differential equations is shown. The method takes advantage of multilevel structure in expansions…
We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.
We generalise the Siegel-Voloch theorem about S-integral points on elliptic curves as follows: let K/F denote a global function field over a finite field F of characteristic p>3, let S denote a finite set of places of K and let E/K denote a…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then…
For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…