Related papers: Finitely Generated Groups Are Universal

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

In 2000, M. Burger and S. Mozes introduced universal groups acting on trees with a prescribed local action. We generalize this concept to groups acting on right-angled buildings. When the right-angled building is thick and irreducible of…

It is proven that an infinite finitely generated group cannot be elementarily equivalent to an ultraproduct of finite groups of a given Pr\"ufer rank. Furthermore, it is shown that an infinite finitely generated group of finite Pr\"ufer…

We call a semigroup $S$ f-noetherian if every right congruence of finite index on $S$ is finitely generated. We prove that every finitely generated semigroup is f-noetherian, and investigate whether the properties of being f-noetherian and…

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories, which can be made all-loop finite, both in the dimensionless (gauge and Yukawa couplings) and dimensionful (soft supersymmetry breaking terms) sectors. This…

Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…

In this paper we compute extension groups in the category of strict polynomial superfunctors and thereby exhibit certain "universal extension classes" for the general linear supergroup. Some of these classes restrict to the universal…

In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Let $\mathcal{C}$ be a class of finite groups closed for subgroups, quotients groups and extensions. Let $\Gamma$ be a finite simplicial graph and $G = G_{\Gamma}$ be the corresponding pro-$\mathcal C$ RAAG. We show that if $N$ is a…

We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of…

In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.

The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…

We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…

We show that connected separable locally compact groups are infinitesimally finitely generated, meaning that there is an integer $n$ such that every neighborhood of the identity contains $n$ elements generating a dense subgroup. We…

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…

We investigate when the clone of congruence preserving functions is finitely generated. We obtain a full description for all finite $p$-groups, and for all finite algebras with Mal'cev term and simple congruence lattice. The…

The generalised Fitting subgroup of a finite group is the group generated by all subnormal subgroups that are either nilpotent or quasisimple. The importance of this subgroup in finite group theory stems from the fact that it always…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…