Related papers: Finite axiomatizability for profinite groups

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

We survey several notions of Mackey functors and biset functors found in the literature and prove some old and new theorems comparing them. While little here will surprise the experts, we draw a conceptual and unified picture by making…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

Although $S_\infty$ (the group of all permutations of $\mathbb{N}$) is size continuum, both it and its closed subgroups can be presented as the set of paths through a countable tree. The subgroups of $S_\infty$ that can be presented this…

We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…

We provide a characterization of those relation algebras which are isomorphic to the algebras of compatible relations of some $\Z_2$-set. We further prove that this class is finitely axiomatizable in first-order logic in the language of…

A group is said to be strongly amenable if each of its proximal topological actions has a fixed point. We show that a finitely generated group is strongly amenable if and only if it is virtually nilpotent. More generally, a countable…

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

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…

We introduce an extension of the (tame) polynomial automorphism group over finite fields: the profinite (tame) polynomial automorphism group, which is obtained by putting a natural topology on the automorphism group. We show that most known…

A group $G$ is said to have dense normalizers if each non-empty open interval in its subgroup lattice $L(G)$ contains the normalizer of a certain subgroup of $G$. In this note, we find all finite groups satisfying this property. We also…

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…

We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.