An explanation for the similar appearance of two identities involving Dickson polynomials

This article explains the similar appearance of two polynomial identities involving Dickson polynomials in char. 2, one found by Abhyankar, Cohen and Zieve, and the other found by the author.     

Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order 2m3 over finite fields

In this paper, we derive explicit factorizations of generalized cyclotomic polynomials and generalized Dickson polynomials of the first kind of order $2^{m}3$, over finite field $F_q$.     

Explicit factorizations of generalized Dickson polynomials of order 2m via generalized cyclotomic polynomials over finite fields

We derive explicit factorizations of generalized cyclotomic polynomials of order $2^m$ and generalized Dickson polynomials of the first kind of order $2^m$ over finite field $F_q$.     

Necessary conditions for reversed Dickson polynomials of the second kind to be permutational

In this paper, we present several necessary conditions for the reversed Dickson polynomial $E_n(1,x)$ of the second kind to be a permutation of ${\mathbb{F}}_q$. In particular, we give explicit evaluation of the sum ${\sum }_{a\in {\mathbb{F}}_q}{E}_n(1,a)$.     

Multivariate Markov polynomial inequalities and Chebyshev nodes

This article considers the extension of V.A. Markov's theorem for polynomial derivatives to polynomials with unit bound on the closed unit ball of any real normed linear space. We show that this extension is equivalent to an inequality for certain directional derivatives of polynomials in two variables that have unit bound on the Chebyshev nodes. We obtain a sharpening of the Markov inequality for polynomials whose values at specific points have absolute value less than one. We also obtain an interpolation formula for polynomials in two variables where the interpolation points are Chebyshev nodes.     

一些包含Chebyshev多项式和Stirling数的恒等式

利用初等方法研究Chebyshev多项式的性质,建立了广义第二类Chebyshev多项式的一个显明公式,并得到了一些包含第一类Chebyshev多项式,第一类Stirling数和Lucas数的恒等式.     

Resultants and discriminants of Chebyshev and related polynomials

We show that the resultants with respect to of certain linear forms in Chebyshev polynomials with argument are again linear forms in Chebyshev polynomials. Their coefficients and arguments are certain rational functions of the coefficients of the original forms. We apply this to establish several related results involving resultants and discriminants of polynomials, including certain self-reciprocal quadrinomials.

     

Generalized trigonometry and Chebyshev functions in finite fields

Trigonometry in finite fields was introduced by de Souza et al. and further developed by Lima and Panario and others, giving functions with many properties similar to trigonometric functions over the reals. Those explorations used a degree-2 extension of a base field. While this corresponds most closely to trigonometry over the reals, in finite fields we can have extensions of other degrees. In this paper we generalize the definitions of trigonometric functions and their related Chebyshev polynomials to arbitrary degrees and explore their properties. Many familiar results carry over into the generalized setting.     

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x ²ⁿ + y ²ⁿ , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.     

Discriminants of polynomials related to Chebyshev polynomials: The “Mutt and Jeff ” syndrome

The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other?s. Remarkably, these polynomials of dissimilar size have “almost” the same roots, and their discriminants involve exactly the same prime factors.     

Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields

We examine the problem of factoring the th cyclotomic polynomial, over , and distinct primes. Given the traces of the roots of we construct the coefficients of in time . We demonstrate a deterministic algorithm for factoring in time when has precisely two irreducible factors. Finally, we present a deterministic algorithm for computing the sum of the irreducible factors of in time .

     

Congruence preserving functions in the residue class rings of polynomials over finite fields

In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine a necessary and sufficient condition under which all congruence preserving functions are also polynomial functions, and characterize such functions.