The group of invariants of an inner function with finite spectrum

This paper determines the group of continuous invariants corresponding to an inner function circle dot with finitely many singularities on the unit circle T; that is, the continuous mappings g : T -> T such that circle dot o g = circle dot on T. These mappings form a group under composition.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )