相关论文: Descriptive complexity of subsets of the space of …

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 the space of marked groups. We point out that several distinct…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…

We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…

In this paper we further develop the theory of canonical approximations of Polishable subgroups of Polish groups, building on previous work of Solecki and Farah--Solecki. In particular, we obtain a characterization of such canonical…

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 particular emphasize the link between the growth of the depth…

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…

We give strong necessary conditions on the admissibility of a Polish group topology for an arbitrary graph product of groups $G(\Gamma, G_a)$, and use them to give a characterization modulo a finite set of nodes. As a corollary, we give a…

Let G be a closed subgroup of the group of all permutations of a countably infinite set. Let X be a Polish G-space with a countable basis A of clopen sets. Each x from X defines a characteristic function f on A by f(U)=1 iff x belongs to U…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

The space of unitary $C_{0}$-semigroups on separable infinite dimensional Hilbert space, when viewed under the topology of uniform weak convergence on compact subsets of $\mathbb{R}_{+}$, is known to admit various interesting residual…

We associate to every action of a Polish group on a standard probability space a Polish group that we call the orbit full group. For discrete groups, we recover the well-known full groups of pmp equivalence relations equipped with the…

Group cohomology of polynomial growth is defined for any finitely generated discrete group, using cochains that have polynomial growth with respect to the word length function. We give a geometric condition that guarantees that it agrees…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We show that every Grigorchuk group $G_\omega$ embeds in (the commutator subgroup of) the topological full group of a minimal subshift. In particular, the topological full group of a Cantor minimal system can have subgroups of intermediate…

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…

We describe constraints that need to be satisfied ``near the top'' of the portraits of the elements in Grigorchuk group. These constraints, if satisfied by the portraits of all sections of some binary tree automorphism, guarantee that this…