What "source signals" admit an error-free, finite memory, asynchronous coding scheme into strings over a k-letter alphabet? Krieger's famous embedding theorem (1982) answers a dynamical formulation of the above problem by providing a complete characterization of the subsystems for a mixing shift of finite type. This talk will describe a new embedding theorem that generalizes Krieger's theorem to the multidimensional case. Previously, Lightwood (2003) obtained a characterization of the aperiodic subsystems for "sufficiently nice" multidimensional shifts of finite type.
Meeting ID: 852 4277 3200 Passcode: 103121