Linear permutation polynomials with coefficients in a subfield
نویسندگان
چکیده
منابع مشابه
Operational matrices with respect to Hermite polynomials and their applications in solving linear differential equations with variable coefficients
In this paper, a new and efficient approach is applied for numerical approximation of the linear differential equations with variable coeffcients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansion coeffcients for the moments of derivatives of any differentiable function in terms of the original expansion coefficients of the f...
متن کاملPolynomials with Nonnegative Coefficients
The authors verify the conjecture that a conjugate pair of zeros can be factored from a polynomial with nonnegative coefficients so that the resulting polynomial still has nonnegative coefficients. The conjecture was originally posed by A. Rigler, S. Trimble, and R. Varga arising out of their work on the Beauzamy-Enflo generalization of Jensen's inequality. The conjecture was also made independ...
متن کاملPermutation Polynomials, de Bruijn Sequences, and Linear Complexity
The paper establishes a connection between the theory of permutation polynomials and the question of whether a de Bruijn sequence over a general finite field of a given linear complexity exists. The connection is used both to construct span 1 de Bruijn sequences (permutations) of a range of linear complexities and to prove non-existence results for arbitrary spans. Upper and lower bounds for th...
متن کاملPolynomials with Coefficients from a Finite Set
In 1945 Duffin and Schaeffer proved that a power series that is bounded in a sector and has coefficients from a finite subset of C is already a rational function. Their proof is relatively indirect. It is one purpose of this paper to give a shorter direct proof of this beautiful and surprising theorem. This will allow us to give an easy proof of a recent result of two of the authors stating tha...
متن کاملFactoring Polynomials with Rational Coefficients
In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial f e Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1973
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-24-2-193-199