The system will be going down for regular maintenance. Please save your work and logout.
Upper bounds on the heights of polynomials and rational fractions from their values
KIEFFER, Jean
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
KIEFFER, Jean
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Article de revue
This item was published in
Acta Arithmetica. 2022-03-21, vol. 203, n° 1, p. 49-68
Instytut Matematyczny PAN
English Abstract
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small ...Read more >
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review well-known bounds obtained from interpolation algorithms given values at $d+1$ (resp. $2d+1$) points, and obtain tighter results when considering a larger number of evaluation points.Read less <
English Keywords
Polynomials
Rational fraction
Heights
Origin
Hal imported