Computable paradoxical decompositions
From MaRDI portal
Publication:5084297
DOI10.1142/S0218196722500400OpenAlexW4224022859MaRDI QIDQ5084297
No author found.
Publication date: 24 June 2022
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.07730
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Means on groups, semigroups, etc.; amenable groups (43A07) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups
- Baire measurable paradoxical decompositions via matchings
- Un résultat de Tarski sur les actions moyennables de groupes et les partitions paradoxales. (A result of Tarski on amenable actions of groups and paradoxical decompositions)
- Følner functions and the generic word problem for finitely generated amenable groups
- About von Neumann's problem for locally compact groups
- On decidability of amenability in computable groups
- Computable permutations and word problems
- Topological dimension and dynamical systems. Translated from the French by the author
- Sofic profiles of \(S(\omega)\) and computability
- Subgroup properties of fully residually free groups
- Turing Computability
- An Effective Version of Hall's Theorem
- Cellular Automata and Groups
- Nonamenability and Borel Paradoxical Decompositions for Locally Compact Groups
- Amenability and paradoxical decompositions for pseudogroups and for discrete metric spaces
- Computability of Følner sets
- On Følner sets in topological groups
- Finitely presented expansions of groups, semigroups, and algebras
- Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
- The characteristic function of a sequence of sets and some of its applications
This page was built for publication: Computable paradoxical decompositions
