Salomon's Theorem for polynomials with several parameters
Maria Frontczak, Przemysław Skibiński, Stanisław Spodzieja (1999)
Colloquium Mathematicae
Similarity:
Maria Frontczak, Przemysław Skibiński, Stanisław Spodzieja (1999)
Colloquium Mathematicae
Similarity:
Brunotte, Horst (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.
Daniel Davies (1996)
Colloquium Mathematicae
Similarity:
Michael Filaseta, Carrie Finch, Charles Nicol (2006)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We answer three reducibility (or irreducibility) questions for -polynomials, those polynomials which have every coefficient either or . The first concerns whether a naturally occurring sequence of reducible polynomials is finite. The second is whether every nonempty finite subset of an infinite set of positive integers can be the set of positive exponents of a reducible -polynomial. The third is the analogous question for exponents of irreducible -polynomials.
Brunotte, Horst (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Janusz Gwoździewicz (1998)
Banach Center Publications
Similarity:
Bernard de Mathan (1992)
Acta Arithmetica
Similarity:
In this paper, we study rational approximations for algebraic functions in characteristic p > 0. We obtain results for elements satisfying an equation of the type , where q is a power of p.
Topuridze, N. (2003)
Georgian Mathematical Journal
Similarity: