Hyperexpansive completion problem via alternating sequences; an application to subnormality

Truncations of completely alternating sequences are entirely characterized. The completely hyperexpansive completion problem is solved for finite sequences of (positive) numbers in terms of positivity of attached matrices. Solutions to the problem are written explicitly for sequences of two, three, four, five and six numbers. As an application, an explicit solution of the subnormal completion problem for five numbers is given.