Related papers: Some algorithms for skew polynomials over finite f…
Skew orthogonal polynomials arise in the calculation of the $n$-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely…
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in a skew-polynomial ring and decomposing $p^s$-polynomials…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We introduce a class of rings using which we define the concept of skew regularity for quaternion-valued functions over quaternions. It is shown that the notion of skew regularity coincides with the concept of slice regularity over…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
Let $D$ be a finite-dimensional division algebra over its center and $R=D[t;\sigma,\delta]$ a skew polynomial ring. Under certain assumptions on $\delta$ and $\sigma$, the ring of central quotients $D(t;\sigma,\delta) = \{f/g \,|\, f \in…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…
We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].
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.
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
In this article, we study skew cyclic codes over ring $R=\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$, where $q=p^{m}$, $p$ is an odd prime and $v^{3}=v$. We describe generator polynomials of skew cyclic codes over this ring and…
Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…