3 citations · 6 across the 8 of their papers we have counts for
10 papers
Torsion-freeness problem for matrix groups
Ruiwen Dong, Emmanuel Rauzy
We establish three results on decision problems for finitely generated matrix groups, based on fiber products: The torsion-freeness problem is undecidable for subgroups o…
Computable Bases
Vasco Brattka, Emmanuel Rauzy
In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countab…
Effective bases and notions of effective second countability in computable analysis
Vasco Brattka, Emmanuel Rauzy
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider co…
A robust family of residually finite groups; spectra of residual finiteness growth, computability properties, and other applications (with an appendix by Arman Darbinyan and Emmanuel Rauzy)
Arman Darbinyan, Emmanuel Rauzy
In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. Firs…
Groups with presentations in EDT0L
Laurent Bartholdi, Leon Pernak, Emmanuel Rauzy
To any family of languages LAN, let us associate the class, denoted , of finitely generated groups that admit a group presentation whose set of relators forms a lang…
New definitions in the theory of Type 1 computable topological spaces
Emmanuel Rauzy
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the…
Remarks and problems about algorithmic descriptions of groups
Emmanuel Rauzy
Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to…
Computable analysis on the space of marked groups
Emmanuel Rauzy
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on th…
Computability of finite quotients of finitely generated groups
Emmanuel Rauzy
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particula…
Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
Emmanuel Rauzy
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually fini…