Related papers: Finitely Generated Groups Are Universal
A subgroup Q is commensurated in a group G if each G conjugate of Q intersects Q in a group that has finite index in both Q and the conjugate. So commensurated subgroups are similar to normal subgroups. Semistability and simple connectivity…
The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…
It is known that in any free group the isolator of finitely generated subgroup is finitely generated subgroup. A very simple proof of this statement is proposed.
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
The class of all countable differentially closed differential fields $K$ of characteristic $0$ was shown by Marker and the author to be "one jump away" from universal for spectra of structures: for every nontrivial countable structure…
Explainable machine learning methods have been accompanied by substantial development. Despite their success, the existing approaches focus more on the general framework with no prior domain expertise. High-stakes financial sectors have…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
The aim of this paper is to develop the theory of groups definable in the $p$-adic field ${\mathbb Q}_p$, with ``definable $f$-generics" in the sense of an ambient saturated elementary extension of ${\mathbb Q}_p$. We call such groups…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…
We consider in general terms dynamical systems with finite-dimensional, non-simply connected configuration-spaces. The fundamental group is assumed to be finite. We analyze in full detail those ambiguities in the quantization procedure that…
We prove that every finitely generated, residually finite group $G$ embeds into a finitely generated perfect branch group $\Gamma$ such that many properties of $G$ are preserved under this embedding. Among those are the properties of being…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the…
Hughes has defined a class of groups, which we call FSS (finite similarity structure) groups. Each FSS group acts on a compact ultrametric space by local similarities. The best-known example is Thompson's group V. Guided by previous work on…
The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…