|
Online Slides |
PDF |
Small
PDF |
PS |
|
RevEng
|
|
| |
|
A Collection of Open Problems |
|
| |
|
The Average Norm of Polynomials |
|
| |
|
Monic Integer Cheyshev Problem |
|
| |
|
The Amazing Number Pi (*large file*) |
 |
|  |
|
The Unreasonable Efficacy of Symbolic Computation |
|
|
 |
|
Small Norm Problems of Erdos-Littlewood Type |
|
| |
|
Computations on Pisot Numbers |
|
| |
|
The 40 Trillionth Binary Digit of Pi is 0
|
|
|
|
|
COGNOS
Lecture: 2000 |
|
|
|
|
Erdos and Polynomials: 1999
|
|
|
|
|
Vignettes involving Rational Functions |
|
|
|
|
ECCAD
|
|
|
|
|
Merit
Factor Problems |
|
|
|
|
The Nature of Mathematics
|
|
|
|
|
Polynomials with Integer Coefficients and Small Norm
|
|
|
|
|
Littlewood Type Problems on Subarcs
|
|
|
|
|
Prouhet,
Tarry, Escott revisited |
|
|
|
|
Mathematics on Mainstreet
|
|
|
|
|
Frontier's Lecture : Some Old Problems on Polynomials with integer Coefficients:
|
|
|
|
|
Incomplete Rationals
|
|
|
|
|
|
A Sharp Bernstein-Type inequality for Exponential Sums
|
|
|
|
|
|
A Very Simple Class of Algorithms for the Riemann-Zeta Function
|
|
|
|
|
|
Müntz Polynomials |
|
|
|
|
Some Distinctive Inequalities
|
|
|
|
|
On
the Computation of Pi |
|
|
|