We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

Abstract Customers demand and manufacturers strive for increasingly higher product reliability. Statistics plays a key role in achieving this. Necip Doganaksoy, William Q. Meeker Gerald J. Hahn explain how

Bethe ansatz formulation is presented for several explicit examples of quasi exactly solvable difference equations of one degree of freedom which are introduced recently by one of the present authors. These equations are deformation of the well-known exactly solvable difference equations of the Meixner–Pollaczek, continuous Hahn, continuous dual Hahn, Wilson and Askey–Wilson polynomials. Up to ...

We show that for every set of discrete polynomials yn(x(s)) on the lattice x(s), defined on a finite interval (a, b), it is possible to construct two sets of dual polynomials zk(ξ(t)) of degrees k = s−a and k = b− s− 1. Here we do this for the classical and alternative Hahn and Racah polynomials as well as for their q-analogs. Also we establish the connection between classical and alternative f...