In a paper from 1980, Shelah constructed an uncountable group all of whose proper subgroups are countable. Assuming the continuum hypothesis, he constructed an uncountable group G that moreover admits an integer n satisfying that for every uncountable $X\subseteq G$, every element of G may be written as a group word of length n in the elements of X. The former is called a Jónsson group, and the latter is called a Shelah group.

In this paper, we construct a Shelah group on the grounds of $\textsf {{ZFC}}$ alone – that is, without assuming the continuum hypothesis. More generally, we identify a combinatorial condition (coming from the theories of negative square-bracket partition relations and strongly unbounded subadditive maps) sufficient for the construction of a Shelah group of size $\kappa $, and we prove that the condition holds true for all successors of regular cardinals (such as $\kappa =\aleph _1,\aleph _2,\aleph _3,\ldots $). This also yields the first consistent example of a Shelah group of size a limit cardinal.

For a post-critically finite branched covering of the sphere that is a subdivision map of a finite subdivision rule, we define non-expanding spines which determine the existence of a Levy cycle in a non-exhaustive semi-decidable algorithm. Especially when a finite subdivision rule has polynomial growth of edge subdivisions, the algorithm terminates very quickly, and the existence of a Levy cycle is equivalent to the existence of a Thurston obstruction. To show the equivalence between Levy and Thurston obstructions, we generalize the arcs intersecting obstruction theorem by Pilgrim and Tan [Combining rational maps and controlling obstructions. Ergod. Th. & Dynam. Sys. 18(1) (1998), 221–245] to a graph intersecting obstruction theorem. As a corollary, we prove that for a pair of post-critically finite polynomials, if at least one polynomial has core entropy zero, then their mating has a Levy cycle if and only if the mating has a Thurston obstruction.

We study a family of finitely generated residually finite small-cancellation groups. These groups are quotients of $F_2$ depending on a subset $S$ of positive integers. Varying $S$ yields continuously many groups up to quasi-isometry.

Given groups $A$ and $B$, what is the minimal commutator length of the 2020th (for instance) power of an element $g\in A*B$ not conjugate to elements of the free factors? The exhaustive answer to this question is still unknown, but we can give an almost answer: this minimum is one of two numbers (simply depending on $A$ and $B$). Other similar problems are also considered.

We present a metric condition $\TTMetric$ which describes the geometry of classical small cancellation groups and applies also to other known classes of groups such as two-dimensional Artin groups. We prove that presentations satisfying condition $\TTMetric$ are diagrammatically reducible in the sense of Sieradski and Gersten. In particular, we deduce that the standard presentation of an Artin group is aspherical if and only if it is diagrammatically reducible. We show that, under some extra hypotheses, $\TTMetric$-groups have quadratic Dehn functions and solvable conjugacy problem. In the spirit of Greendlinger's lemma, we prove that if a presentation P = 〈X| R〉 of group G satisfies conditions $\TTMetric -C'(\frac {1}{2})$, the length of any nontrivial word in the free group generated by X representing the trivial element in G is at least that of the shortest relator. We also introduce a strict metric condition $\TTMetricStrict$, which implies hyperbolicity.

Diagrammatic reducibility DR and its generalization, vertex asphericity VA, are combinatorial tools developed for detecting asphericity of a 2-complex. Here we present tests for a relative version of VA that apply to pairs of 2-complexes $(L,K)$, where K is a subcomplex of L. We show that a relative weight test holds for injective labeled oriented trees, implying that they are VA and hence aspherical. This strengthens a result obtained by the authors in 2017 and simplifies the original proof.

We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to generalize results of J. Howie and S.M. Gersten on asphericity of LOTs and of Adian presentations, and derive new results on solvability of equations over groups. We also use our methods to investigate a conjecture of S.V. Ivanov related to Kaplansky's problem on zero divisors: we strengthen Ivanov's result for locally indicable groups and prove a weak version of the conjecture.

We study the geometry of infinitely presented groups satisfying the small cancellation condition $C^{\prime }(1/8)$, and introduce a standard decomposition (called the criss-cross decomposition) for the elements of such groups. Our method yields a direct construction of a linearly independent set of power continuum in the kernel of the comparison map between the bounded and the usual group cohomology in degree 2, without the use of free subgroups and extensions.

Our main result is that many triangles of Baumslag–Solitar groups collapse to finite groups, generalizing a famous example of Hirsch and other examples due to several authors. A triangle of Baumslag–Solitar groups means a group with three generators, cyclically ordered, with each generator conjugating some power of the previous one to another power. There are six parameters, occurring in pairs, and we show that the triangle fails to be developable whenever one of the parameters divides its partner, except for a few special cases. Furthermore, under fairly general conditions, the group turns out to be finite and solvable of derived length $\le \,3$ . We obtain a lot of information about finite quotients, even when we cannot determine developability.

The first main result of the paper is a criterion for a partially commutative group $\mathbb{G}$ to be a domain. It allows us to reduce the study of algebraic sets over $\mathbb{G}$ to the study of irreducible algebraic sets, and reduce the elementary theory of $\mathbb{G}$ (of a coordinate group over $\mathbb{G}$ ) to the elementary theories of the direct factors of $\mathbb{G}$ (to the elementary theory of coordinate groups of irreducible algebraic sets).

Then we establish normal forms for quantifier-free formulas over a non-abelian directly indecomposable partially commutative group $\mathbb{H}$ . Analogously to the case of free groups, we introduce the notion of a generalised equation and prove that the positive theory of $\mathbb{H}$ has quantifier elimination and that arbitrary first-order formulas lift from $\mathbb{H}$ to $\mathbb{H}\,*\,F$ , where $F$ is a free group of finite rank. As a consequence, the positive theory of an arbitrary partially commutative group is decidable.

A group G is called morphic if every endomorphism α:G→G for which Gα◃G satisfies G/Gα≅ker (α). Call an endomorphism α∈end(G) regular if αβα=α for some β∈end(G), and call α unit regular if β can be chosen to be an automorphism of G. The main purpose of this paper is to prove the following group-theoretic analogue of a theorem of Ehrlich: if G is a morphic group, an endomorphism α:G→G for which Gα◃G is unit regular if and only if it is regular. As an application, a cancellation theorem is proved that characterizes the morphic groups among those with regular endomorphism monoids.

We exploit duality considerations in the study of singular combinatorial 2-discs (diagrams) and are led to the following innovations concerning the geometry of the word problem for finite presentations of groups. We define a filling function called gallery length that measures the diameter of the 1-skeleton of the dual of diagrams; we show it to be a group invariant and we give upper bounds on the gallery length of combable groups. We use gallery length to give a new proof of the Double Exponential Theorem. Also we give geometric inequalities relating gallery length to the space-complexity filling function known as filling length.

a conjecture is proposed, bounding the number of cycles with label $w^n$ in a labeled directed graph. some partial results towards this conjecture are established. as a consequence, it is proved that $\langle a_1, a_2, \ldots\,{\mid}\,w^n\rangle$ is coherent for $n\,{\geq}\,4$. furthermore, it is coherent for $n\,{\geq}\,2$, provided that the strengthened hanna neumann conjecture holds.

We pose some graph theoretic conjectures about duality and the diameter of maximal trees in planar graphs, and we give innovations in the following two topics in geometric group theory, where the conjectures have applications.

Central extensions. We describe an electrostatic model concerning how van Kampen diagrams change when one takes a central extension of a group. Modulo the conjectures, this leads to a new proof that finitely generated class $c$ nilpotent groups admit degree $c+1$ polynomial isoperimetric functions.

Filling functions. We collate and extend results about interrelationships between filling functions for finite presentations of groups. We use the electrostatic model in proving that the gallery length filling function, which measures the diameter of the duals of diagrams, is qualitatively the same as a filling function DlogA, concerning the sum of the diameter with the logarithm of the area of a diagram. We show that the conjectures imply that the space-complexity filling function filling length essentially equates to gallery length. We give linear upper bounds on these functions for a number of classes of groups including fundamental groups of compact geometrizable 3-manifolds, certain graphs of groups, and almost convex groups. Also we define restricted filling functions which concern diagrams with uniformly bounded vertex valence, and we show that, assuming the conjectures, they reduce to just two filling functions—the analogues of non-deterministic space and time.

We investigate the problem of whether every immersed flat plane in a nonpositively curved square complex is the limit of periodic flat planes. Using a branched cover, we reduce the problem to the case of $\mathcal{V}\mathcal{H}$ -complexes. We solve the problem for malnormal and cyclonormal $\mathcal{V}\mathcal{H}$ -complexes. We also solve the problem for complete square complexes using a different approach. We give an application towards deciding whether the elements of fundamental groups of the spaces we study have commuting powers. We note a connection between the flat approximation problem and subgroup separability.

A proof is given that the quasivariety of groups generated by finite and torsion-free groups does not contain the class of periodic groups. This result is related to (and inspired by) the solvability of equations over groups. The proof uses the Feit–Thompson theorem on the solvability of finite groups of odd order as well as Kostrikin–Zelmanov results on the restricted Burnside problem, and applies technical details of a recent construction of weakly finitely presented periodic groups.

We obtain a number of results regarding the freeness of subgroups of Coxeter groups, Artin groups and one-relator groups with torsion. In the case of Coxeter groups, we also obtain results on quasiconvexity and subgroup separability.

We show that diagrammatically reducible two-complexes are characterized by the property: every finity subconmplex of the universal cover collapses to a one-complex. We use this to show that a compact orientable three-manifold with nonempty boundary is Haken if and only if it has a diagrammatically reducible spine. We also formulate an nanlogue of diagrammatic reducibility for higher dimensional complexes. Like Haken three-manifolds, we observe that if n ≥ 4 and M is compact connected n-dimensional manifold with a traingulation, or a spine, satisfying this property, then the interior of the universal cover of M is homeomorphic to Euclidean n-space.

In previous work [2] calculations of subquadratic second order Dehn functions for various groups were carried out. In this paper we obtain estimates for upper and lower bounds of second order Dehn functions of HNN-extensions, and use these to exhibit an infinite number of different superquadratic second order Dehn functions. At the end of the paper several open questions concerning second order Dehn functions of groups are discussed.

We show that the group F discovered by Richard Thompson in 1965 has a subexponential upper bound for its Dehn function. This disproves a conjecture by Gersten. We also prove that F has a regular terminating confluent presentation.