- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Tilings of amenable groups and a problem of codeability
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Tilings of amenable groups and a problem of codeability Downarowicz, Tomasz
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.
Item Metadata
Title |
Tilings of amenable groups and a problem of codeability
|
Creator | |
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 | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Wrocław U of Science and Technology
|
Series | |
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 | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International