Pseudo linear transformations and evaluation in Ore extensions.
Leroy, André (1995)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Leroy, André (1995)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Akritas, Alkiviadis (2015)
Serdica Journal of Computing
Similarity:
Given the polynomials f, g ∈ Z[x] of degrees n, m, respectively, with n > m, three new, and easy to understand methods — along with the more efficient variants of the last two of them — are presented for the computation of their subresultant polynomial remainder sequence (prs). All three methods evaluate a single determinant (subresultant) of an appropriate sub-matrix of sylvester1, Sylvester’s widely known and used matrix of 1840 of dimension (m + n) × (m + n), in order to compute...
Manfred G. Madritsch (2014)
Acta Arithmetica
Similarity:
We construct normal numbers in base q by concatenating q-ary expansions of pseudo-polynomials evaluated at primes. This extends a recent result by Tichy and the author.
H. Kaufman, Mira Bhargava (1965)
Collectanea Mathematica
Similarity:
Shih Ping Tung (2006)
Acta Arithmetica
Similarity:
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
Mira Bhargava (1964)
Collectanea Mathematica
Similarity:
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
W. Głocki (1987)
Applicationes Mathematicae
Similarity:
Ivan Gutman (1982)
Publications de l'Institut Mathématique
Similarity:
Akritas, Alkiviadis G., Malaschonok, Gennadi I., Vigklas, Panagiotis S. (2016)
Serdica Journal of Computing
Similarity:
In this paper we present two new methods for computing the subresultant polynomial remainder sequence (prs) of two polynomials f, g ∈ Z[x]. We are now able to also correctly compute the Euclidean and modified Euclidean prs of f, g by using either of the functions employed by our methods to compute the remainder polynomials. Another innovation is that we are able to obtain subresultant prs’s in Z[x] by employing the function rem(f, g, x) to compute the remainder polynomials in [x]. This...
Furtado, Susana, Silva, Fernando C. (1998)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity: