Self-reciprocal polynomials over finite fields.
Meyn, Helmut, Götz, Werner (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “Root separation for reducible monic quartics”
Self-reciprocal polynomials over finite fields.
On polynomials taking small values at integral arguments II
Roberto Dvornicich, Shih Ping Tung, Umberto Zannier (2003)
Acta Arithmetica
Similarity:
A unified class of polynomials.
Agrawal, Hukum Chand (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Root separation for reducible integer polynomials
Yann Bugeaud, Andrej Dujella (2014)
Acta Arithmetica
Similarity:
We construct parametric families of (monic) reducible polynomials having two roots very close to each other.
Commuting polynomials and self-similarity.
Zimmermann, Karl (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Selected Chapters from Algebra, II
I. R. Shafarevich (1999)
The Teaching of Mathematics
Similarity:
A Goldbach theorem for polynomials of low degree over odd finite fields
Gove Effinger (1983)
Acta Arithmetica
Similarity:
Factorisation of over Q
Henk Hollmann (1986)
Acta Arithmetica
Similarity:
Reciprocal Stern Polynomials
A. Schinzel (2015)
Bulletin of the Polish Academy of Sciences. Mathematics
Similarity:
A partial answer is given to a problem of Ulas (2011), asking when the nth Stern polynomial is reciprocal.
Some results on biorthogonal polynomials.
Ruedemann, Richard W. (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
An algorithm for finding distinguished chains of polynomials.
Zaharescu, Alexandru (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
On the irreducibility of the generalized Laguerre polynomials
M. Filaseta, T.-Y. Lam (2002)
Acta Arithmetica
Similarity:
On Roots of Polynomials and Algebraically Closed Fields
Christoph Schwarzweller (2017)
Formalized Mathematics
Similarity:
In this article we further extend the algebraic theory of polynomial rings in Mizar [1, 2, 3]. We deal with roots and multiple roots of polynomials and show that both the real numbers and finite domains are not algebraically closed [5, 7]. We also prove the identity theorem for polynomials and that the number of multiple roots is bounded by the polynomial’s degree [4, 6].
Algebraic condition for decomposition of large-scale linear dynamic systems
Henryk Górecki (2009)
International Journal of Applied Mathematics and Computer Science
Similarity:
The paper concerns the problem of decomposition of a large-scale linear dynamic system into two subsystems. An equivalent problem is to split the characteristic polynomial of the original system into two polynomials of lower degrees. Conditions are found concerning the coefficients of the original polynomial which must be fulfilled for its factorization. It is proved that knowledge of only one of the symmetric functions of those polynomials of lower degrees is sufficient for factorization...
Solving quadratic equations over polynomial rings of characteristic two.
Jorgen Cherly, Luis Gallardo, Leonid Vaserstein, Ethel Wheland (1998)
Publicacions Matemàtiques
Similarity:
We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A. We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction,...