Related papers: Sentences over Random Groups I: Existential Senten…

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

We investigate conformal dimension for the class of infinite hyperbolic groups in the Gromov density model $\mathcal{G}^d_{m,l}$ of random groups with $m \geq 2$ fixed generators, density $0 < d < 1/2$ and relator length $l \to \infty$. Our…

Let $G$ be a finitely presented group, and let $H$ be a subgroup of $G$. We prove that if $H$ is acylindrically hyperbolic and existentially closed in $G$, then $G$ is acylindrically hyperbolic. As a corollary, any finitely presented group…

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…

This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…

In this paper we describe finitely generated groups $H$ universally equivalent (with constants from $G$ in the language) to a given torsion-free relatively hyperbolic group $G$ with free abelian parabolics. It turns out that, as in the free…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

We introduce a model for random groups in varieties of $n$-periodic groups as $n$-periodic quotients of triangular random groups. We show that for an explicit $d_{\mathrm{crit}}\in(1/3,1/2)$, for densities $d\in(1/3,d_{\mathrm{crit}})$ and…

Let $G$ be a word hyperbolic group. We prove that the algebraic $K$-theory groups of $\dbZ [G]$, $K_n(\dbZ[G])$, have finite rank for all $n\in \dbZ$. For a few classes of groups, we give explicit formulas for the ranks of the algebraic…

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

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…

We define an algebraic group over a group $G$ to be a variety - that is, a subset of $G^d$ defined by equations over $G$ - endowed with a group law whose coordinates can be expressed as word maps. In the case where $G$ is a torsion-free…