The non-resonant bounded uniserial representations of Vec(R) form a certain class of extensions composed of tensor density modules, all of whose subquotients are indecomposable. The problem of classifying the extensions with a given composition series is reduced via cohomological methods to computing the solution of a certain system of polynomial equations in several variables derived from the cup equations for the extension. Using this method, we classify all non-resonant bounded uniserial extensions of Vec(R) up to length 6. Beyond this length, all such extensions appear to arise as subquotients of extensions of arbitrary length, many of which are explained by the psuedodifferential operator modules. Others are explained by a wedge construction and by the pseudodifferential operator cocycle discovered by Khesin and Kravchenko.

In 1980 Feigin and Fuchs classified the length 2 bounded representations of Vec(R), the Lie algebra of polynomial vector fields on the line, as a result of their work on the cohomology of Vec(R). This dissertation is concerned mainly with the uniserial (completely indecomposable) representations of Vec(R) with a single Casimir eigenvalue and weights bounded below. Such representations are composed of irreducible representations with semisimple Euler operator action, bounded weight space dimensions, and weights bounded below. These are known to be the tensor density modules with lowest weight λ, for any non-zero complex number λ, and the trivial module C, with Vec(R) actions π_λ and π_C, respectively. Our proofs are cohomology arguments involving the first cohomology groups of Vec(R) with values in the space of homomorphisms between two irreducible representations. These results classify the finite length uniserial extensions, with a single Casimir eigenvalue, of admissible irreducible Vec(R) representations with weights bounded below. In almost every case there is at most one uniserial representation with a given composition series. However, in the case of an odd length extension with composition series {π_1,π_C,π_1,…,π_C,π_1}, there is a one-parameter family of extensions. We also give preliminary results on uniserial representations of the Virasoro Lie …

Rank one subshifts are dynamical systems generated by a regular combinatorial process based on sequences of positive integers called the cut and spacer parameters. Despite the simple process that generates them, rank one subshifts comprise a generic set and are the source of many counterexamples. As a result, measure theoretic rank one subshifts, called rank one transformations, have been extensively studied and investigations into rank one subshifts been the basis of much recent work. We will answer several open problems about rank one subshifts. We completely classify the maximal equicontinuous factor for rank one subshifts, so that this factor can be computed from the parameters. We use these methods to classify when large classes of rank one subshifts have mixing properties. Also, we completely classify the situation when a rank one subshift can be a factor of another rank one subshift.