English
Related papers

Related papers: A note on factorisation of division polynomials

200 papers

We present a proof of a conjecture of Goh and Wildberger on the factorization of the spread polynomials. We indicate how the factors can be effectively calculated and exhibit a connection to the factorization of Fibonacci numbers into…

Number Theory · Mathematics 2024-12-30 Johann Cigler , Hans-Christian Herbig

Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…

Algebraic Geometry · Mathematics 2007-05-23 Jingzhong Zhang , Yong Feng

In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…

Rings and Algebras · Mathematics 2022-02-21 Johannes Siegele , Martin Pfurner , Hans-Peter Schröcker

We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.

Number Theory · Mathematics 2026-04-13 Robert Pollack , Tom Weston

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Number Theory · Mathematics 2019-01-04 Saiying He , James Mc Laughlin

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

Symbolic Computation · Computer Science 2025-02-26 Alexander Demin , Joris van der Hoeven

We discuss, in a non-Archimedean setting, the distribution of the coefficients of $L$-polynomials of curves of genus $g$ over $\mathbb{F}_q$. Among other results, this allows us to prove that the $\mathbb{Q}$-vector space spanned by such…

Number Theory · Mathematics 2025-07-25 Francesco Ballini , Davide Lombardo , Matteo Verzobio

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Information Theory · Computer Science 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

This note completes a talk given at the conference Curves over Finite Fields: past, present and future celebrating the publication the book {\em Rational Points on Curves over Finite Fields by J.-P. Serre and organised at Centro de ciencias…

Algebraic Geometry · Mathematics 2022-04-05 Alain Couvreur

We show that the Dirac factorization method can be successfully employed to treat problems involving operators raised to a fractional power. The technique we adopt is based on an extension of the Pauli matrices and the properties of the…

Mathematical Physics · Physics 2012-09-12 D. Babusci , G. Dattoli , M. Quattromini , P. E. Ricci

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Algebraic Geometry · Mathematics 2020-06-15 Miguel N. Walsh

Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…

Classical Analysis and ODEs · Mathematics 2007-05-23 Margherita Barile , Fiorella Barone , Wlodzimierz M. Tulczyjew

In a series of papers we classify the possible torsion structures of rational elliptic curves base-extended to number fields of a fixed degree. In this paper we turn our attention to the question of how the torsion of an elliptic curve with…

Number Theory · Mathematics 2021-06-30 Enrique González-Jiménez

We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…

Combinatorics · Mathematics 2016-07-21 Joseph A. Thas , Koen Thas

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

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

Algebraic Geometry · Mathematics 2022-03-03 Elie Eid

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

In our previous work, we gave a formula for the Frobenius eigenvalues of van der Geer--van der Vlugt curves in characteristic 2 by considering suitable quotients of the curve. Although the formula is explicit, it depends on many choices,…

Number Theory · Mathematics 2026-05-19 Tetsushi Ito , Daichi Takeuchi , Takahiro Tsushima

In this paper we will give a global description of the Frobenius for the division fields of an elliptic curve E which is strictly analogous to the cyclotomic case. This is then applied to determine the splitting of a prime p in subfields of…

Number Theory · Mathematics 2007-05-23 William Duke , Arpad Toth

Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…

Logic in Computer Science · Computer Science 2020-12-29 Beniamino Accattoli , Claudia Faggian , Giulio Guerrieri