Probabilistic algorithm for finding roots of linearized polynomials

A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial

On certain linearized polynomials with high degree and kernel of small dimension

Let f be the ${\mathbb{F}}_q$-linear map over ${\mathbb{F}}_{q^{2n}}$ defined by $x?x+a{x}^{q^s}+b{x}^{q^{n+s}}$ with $\gcd ?(n,s)=1$. It is known that the kernel of f has dimension at most 2, as proved by Csajbók et al. in [9]. For n big enough, e.g. $n\ge 5$ when $s=1$, we classify the values of $b/a$ such that the kernel of f has dimension at most 1. To this aim, we translate the problem into the study of some algebraic curves of small degree with respect to the degree of f; this allows to use intersection theory and function field theory together with the Hasse-Weil bound. Our result implies a non-scatteredness result for certain high degree scattered binomials, and the asymptotic classification of a family of rank metric codes.     

Spectral properties of matrix polynomials in the max algebra

We consider the spectral properties of matrix polynomials over the max algebra. In particular, we show how the Perron-Frobenius theorem for the max algebra extends to such polynomials and illustrate the relevance of this for multistep difference equations in the max algebra. We also present a number of inequalities for the largest max eigenvalue of a matrix polynomial.     

New results on quasi-subfield polynomials

Quasi-subfield polynomials were introduced by Huang et al. together with a new algorithm to solve the Elliptic Curve Discrete Logarithm Problem (ECDLP) over finite fields of small characteristic. In this paper we provide both new quasi-subfield polynomial families and a new theorem limiting their existence. Our results do not allow to derive any speedup for the new ECDLP algorithm compared to previous approaches.     

A remark on linear permutation polynomials

We give an explicit representation of the class of linear permutation polynomials. By the representation, the number of them can be computed easily.     

关于勒让德多项式与契贝谢夫多项式间的关系

主要研究勒让德多项式与契贝谢夫多项式之间的关系的性质,利用生成函数和函数级数展开的方法,得出了勒让德多项式与契贝谢夫多项式之间的一个重要关系,这对勒让德多项式与契贝谢夫多项式的研究有一定的推动作用．     

On modified Chebyshev polynomials

In this paper some new properties and applications of modified Chebyshev polynomials and Morgan-Voyce polynomials will be presented. The aim of the paper is to complete the knowledge about all of these types of polynomials.     

An algorithm for the divisors of monic polynomials over a commutative ring

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R₀ ⊕ … ⊕ R_m (m ≤ deg f), associated to a fundamental system of idempotents e₀, … , e_m, such that the component of f in each R_i[X] has degree coefficient which is a unit of R_i. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials.     

On Kernel polynomials and self-perturbation of orthogonal polynomials

Given an orthogonal polynomial system {Q _n (x)} _n=0 ^∞, define another polynomial system by where α _n are complex numbers and t is a positive integer. We find conditions for {P _n (x)} _n=0 ^∞ to be an orthogonal polynomial system. When t=1 and α₁≠0, it turns out that {Q _n (x)} _n=0 ^∞ must be kernel polynomials for {P _n (x)} _n=0 ^∞ for which we study, in detail, the location of zeros and semi-classical character. Received: November 25, 1999; in final form: April 6, 2000?Published online: June 22, 2001     

On evaluating multivariate polynomials over finite fields

Some evaluation methods of multivariate polynomials over finite fields are described and their multiplicative complexity is discussed.     

On some special polynomials

New special functions called -functions are introduced. Connections of -functions with the known Legendre, Chebyshev and Gegenbauer polynomials are given. For -functions the Rodrigues formula is obtained.     

On deficiencies of differential polynomials

Bounds for deficiencies of differential polynomials have been given and some relations between Nevanlinna characteristic of differential polynomials inf and Nevanlinna characteristic function off have been obtained.     

On a family of symmetric polynomials

In this paper, we provide two simple approaches to the explicit expression of a family of symmetric polynomials introduced and studied in Milovanovi? and Cvetkovi? [J. Math. Anal. Appl. 311 (2005) 191], thereby improving on their observations.     

On some cycles in linearized Wenger graphs

Let ${\mathbb{F}}_q$ be the finite field of $q$ elements for prime power $q$ and let $p$ be the character of ${\mathbb{F}}_q$. For any positive integer $m$, the linearized Wenger graph $L_m\left(q\right)$ is defined as follows: it is a bipartite graph with the vertex partitions being two copies of the $(m+1)$-dimensional vector space ${\mathbb{F}}_q^{m+1}$, and two vertices $p=\left(p\left(1\right),\dots ,p(m+1)\right)$ and $l=\left[l\left(1\right),\dots ,l(m+1)\right]$ being adjacent if $p\left(i\right)+l\left(i\right)=p\left(1\right){\left(l\left(1\right)\right)}^{p^{i?2}}$, for all $i=2,3,\dots ,m+1$. In this paper, we show that for any positive integers $m$ and $k$ with $3\le k\le p^2$, $L_m\left(q\right)$ contains even cycles of length $2k$ which is an open problem put forward by Cao et al. (2015).