The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Using refinement of an algorithm given by Habsieger and Salvy to find integer polynomials with smallest sup norm on [0, 1] we extend their table of polynomials up to degree 100. For the degree 95 we find a new exceptionnal polynomial which has complex roots. Our method uses generalized Müntz-Legendre polynomials. We improve slightly the upper bound for the integer transfinite diameter of [0, 1] and give elementary proofs of lower bounds for the exponents of some critical polynomials.
Download Results (CSV)