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

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…

We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.

We obtain explicit factorizations of reduced period polynomials of degree $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. This extends the results of G. Myerson, who considered the cases $m=1$ and $m=2$, and…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…

In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over $\mathbb{F}_3^{2k}$. In addition, new examples and generalizations of some families of permutation polynomials of $\mathbb{F}_{3^k}$ and…

An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…

We present new classes of permutation polynomials over finite fields.

Jones and Boston conjectured that the factorization process for iterates of irreducible quadratic polynomials over finite fields is approximated by a Markov model. In this paper, we find unexpected and intricate behavior for some quadratic…

In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial leads to a generalization of the main result proved by…

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Consider an elliptic curve $E$ over a number field $K$. Suppose that $E$ has supersingular reduction at some prime $\mathfrak{p}$ of $K$ lying above the rational prime $p$. We completely classify the valuations of the $p^n$-torsion points…

This paper considers the factorization of elliptic symbols which can be represented by matrix-valued functions. Our starting point is a \textit{Fundamental Factorization Theorem}, due to Budjanu and Gohberg. We critically examine the work…

Here we present some revised arguments to a randomized algorithm proposed by Sudan to find the polynomials of bounded degree agreeing on a dense fraction of a set of points in $\mathbb{F}^{2}$ for some field $\mathbb{F}$.

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…

For a given point P in the group of K-rational points E(K) of an elliptic curve, we consider the sequence of values (F_1(P),F_2(P),F_3(P),...) of the division polynomials of E at P. If K is a finite field, we prove that the sequence is…

An error in the author's paper (Functiones et Approximatio, 37 . pp. 203-211) is corrected.

We give a simple proof of the well-known divisibility by 2 condition for rational points on elliptic curves with rational 2-torsion. As an application of the explicit division by $2^n$ formulas obtained in Sec.2, we construct versal…