  This work is a study of polynomial compositions having a fixed number of
terms. We outline a recursive method to describe these characterizations, give
some particular results and discuss the general case. In the final sections,
some applications to Universal Hilbert Sets generated by closed forms of linear
recurrence relations and to integer perfect powers having few digits in their
representation in a given scale $x \ge 2$ are provided.
