A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918234735771648 |
|---|---|
| author | Duda, Karol |
| author_facet | Duda, Karol |
| contents | We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the geometric von Neumann conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2105_06304 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture Duda, Karol Logic Combinatorics Group Theory We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the geometric von Neumann conjecture. |
| title | A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture |
| topic | Logic Combinatorics Group Theory |
| url | https://arxiv.org/abs/2105.06304 |