|
Upper bounds for the number of integer polynomials with given discriminants
N. V. Budarinaabc, D. Dickinsonabc, V. I. Bernikabc a Khabarovsk Division of the Institute for Applied Mathematics, Far Eastern Branch, Russian Academy of Sciences
b National University of Ireland, Maynooth
c Institute of Mathematics of the National Academy of Sciences of Belarus
Abstract:
A generalization of the Gelfond theorem on the smallest value of the two integer polynomials without common roots was obtained, taking into account the evaluation of all their derivatives.
Received: 14.06.2015
Citation:
N. V. Budarina, D. Dickinson, V. I. Bernik, “Upper bounds for the number of integer polynomials with given discriminants”, Tr. Inst. Mat., 23:2 (2015), 29–36
Linking options:
https://www.mathnet.ru/eng/timb238 https://www.mathnet.ru/eng/timb/v23/i2/p29
|
Statistics & downloads: |
Abstract page: | 269 | Full-text PDF : | 91 | References: | 44 |
|