A new computable version of Hall's Harem Theorem

Autor:	Duda, Karol
Rok vydání:	2021
Předmět:	Mathematics - Logic Mathematics - Combinatorics Mathematics - Group Theory
Druh dokumentu:	Working Paper
Popis:	We prove a version of Hall's Harem Theorem where the matching realizes a function with some special properties of its cycles. Using this approach we also prove a new computable version of Hall's Harem theorem. We apply it to non-amenable computable coarse spaces. Comment: Major modifications to Theorem 2.1 from the previous version. In fact, the paper is completely rewritten. Former Section 2 divided into Sections 7-12. Proof of Theorem 2.1 divided into construction in Section 9 and Lemmas 4.1, 4.2, 4.4, 10.2, 10.6, 11.1 and 11.5. Some major corrections in the proof. A new theorem concerning classical (i.e. without computability issues) situation (Sections 2-6)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2105.06304 Zobrazit plný text záznamu View this record from Arxiv