A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture

Karol Duda

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…