相关论文: A note on factorisation of division polynomials

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…

Let $E$ be an elliptic curve over the finite field $\mathbb{F}_p$, and $P \in E(\mathbb{F}_p)$ be an $\mathbb{F}_p$-rational point. We obtain nontrivial estimates for multiplicative character sums associated with the division polynomials…

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

We study some properties of the exponents of the terms appearing in the splitting perfect polynomials over $\mathbb{F}_{p^2}$, where $p$ is a prime number. This generalizes the work of Beard et al. over $\mathbb{F}_p$. Corrected paper.…

We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…

We give an algebraic characterization of half-factorial orders in algebraic number fields. This generalizes prior results for seminormal orders and for orders in quadratic number fields.

We discuss a consequence of Green and Tao's factorisation theorem for polynomial orbits on nilmanifolds, adjusted to the requirements of certain arithmetic applications. More precisely, we prove a generalisation of Theorem 16.4, Acta Arith.…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

In this note we correct a technical error occurred in [M. Torrente and M.C. Beltrametti, "Almost vanishing polynomials and an application to the Hough transform", J. Algebra Appl. 13(8), (2014)]. This affects the bounds given in that paper,…

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…

In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

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…