Title	Tilings of amenable groups and a problem of codeability
Creator	Downarowicz, Tomasz
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-07-28T10:21
Description	We improve Ornstein-Weiss' quasitiling of a countable amenable group to a "perfect" tiling. The price is that the number of shapes increases drastically, nonetheless we manage to keep the entropy equal to zero. It remains a challenge to encode the system of tilings in a 0-1 subshift. So far we can do that only under the additional Tempelman's condition. Joint work with Dawid Huczek and Guohua Zhang. Last part with Maxence Phalempin.
Extent	52 minutes
Subject	Mathematics; Dynamical systems and ergodic theory; Global analysis, analysis on manifolds; Dynamical systems
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Wrocław U of Science and Technology
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-01-25
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0363156
URI	http://hdl.handle.net/2429/64459
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos