works on
C(4)-T(4 1C(6 1fixed point properties 1graphical presentations 1small cancellation 1torsion subgroups 1

From the 1 of 5 linked papers with an AI index.

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2025

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…