In this article we introduce the notion of weak identities in a group and study their properties. We show that weak identities have some similar properties to ordinary ones. We use this notion to prove that any finitely generated solvable discriminating group is abelian.
Stalactic, taiga, sylvester and Baxter monoids arise from the combinatorics of tableaux by identifying words over a fixed ordered alphabet whenever they produce the same tableau via some insertion algorithm. In this paper, three sufficient conditions under which semigroups are finitely based are given. By applying these sufficient conditions, it is shown that all stalactic and taiga monoids of rank greater than or equal to $2$ are finitely based and satisfy the same identities, that all sylvester monoids of rank greater than or equal to $2$ are finitely based and satisfy the same identities an…
We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a probabilistic variant of the Tits alternative: let G be the profinite completion of a finitely generated linear group. Then either G is virtually solvable, or for any positive integer n, with probability one, n independent, uniformly distributed elements of G freely generate a free subgroup of G of rank n.
Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the identity. We define bounded groups and groups which are fractal with respect to identities. This notion of being fractal can be viewed as a self-similarity conditions for the set of identities, satisfied by a group. In contrast with torsion groups and Engel groups, groups which are fractal with respect to identities appear among finitely generated elementary amen…
A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to the subgroup of a group $G_0 = < \mathcal A_0 \| \mathcal R_0>$, where $\mathcal A_0 \subseteq \mathcal A$, $\mathcal R_0 \subseteq \mathcal R$ are finite, generated by (images of) the same words. In the article, weakly finitely presented periodic groups which are not locally finite are constructed.
For a finitely generated group $G$ we calculate the Bieri-Neumann-Strebel-Renz invariant $Σ^1(\X(G))$ for the weak commutativity construction $\X(G)$. Identifying $S(\X(G))$ with $S(\X(G) / W(G))$ we show $Σ^2(\X(G),\Z) \subseteq Σ^2(\X(G)/ W(G),\Z)$ and $Σ^2(\X(G)) \subseteq $ $ Σ^2(\X(G)/ W(G))$ that are equalities when $W(G)$ is finitely generated and we explicitly calculate $Σ^2(\X(G)/ W(G),\Z)$ and $ Σ^2(\X(G)/ W(G))$ in terms of the $Σ$-invariants of $G$. We calculate completely the $Σ$-invariants in dimensions 1 and 2 of the group $ν(G)$ and show that if $G$ is finitely generated group …
We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from this construction: $\mathfrak{X}(G)$ is finitely presented if and only if $G$ is finitely presented, but if $F$ is a non-abelian free group of finite rank then $\mathfrak{X}(F)$ has a subgroup of finite index whose third homology is not finitely generated.
We introduce a quantitative notion of lawlessness for finitely generated groups, encoded by the "lawlessness growth function" $\mathcal{A}_Γ : \mathbb{N} \rightarrow \mathbb{N}$. We show that $\mathcal{A}_Γ$ is bounded iff $Γ$ has a nonabelian free subgroup. By contrast we construct, for any nondecreasing unbounded function $f: \mathbb{N} \rightarrow \mathbb{N}$, an elementary amenable lawless groups for which $\mathcal{A}_Γ$ grows more slowly that $f$. We produce torsion lawless groups for which $\mathcal{A}_Γ$ is at least linear using Golod-Shafarevich theory, and give some upper bounds on $…
We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented non-amenable groups without noncyclic free subgroups (which provides a finitely presented counterexample to the von Neumann problem on amenable groups). As another application, we construct weakly finitely presented groups of odd exponent $n \gg 1$ which are not locally finite.
The isoperimeric spectrum consists of all real positive numbers $α$ such that $O(n^α)$ is the Dehn function of a finitely presented group. In this note we show how a recent result of Olshanskii completes the description of the isoperimetric spectrum modulo the celebrated Computer Science conjecture (and one of the seven Millennium Problems) $\mathbf{P=NP}$ and even a formally weaker conjecture.
We show that every finitely generated group admits weak analogues of an invariant expectation, whose existence characterizes exact groups. This fact has a number of applications. We show that Hopf $G$-modules are relatively injective, which implies that bounded cohomology groups with coefficients in all Hopf $G$-modules vanish in all positive degrees. We also prove a general fixed point theorem for actions of finitely generated groups on $\ell_{\infty}$-type spaces. Finally, we define the notion of weak exactness for certain Banach algebras.
Using an analogue of Makanin-Razborov diagrams, we give a description of the solution set of systems of equations over an equationally Noetherian free product of groups $G$. Equivalently, we give a parametrisation of the set $Hom(H, G)$ of all homomorphisms from a finitely generated group $H$ to $G$. Furthermore, we show that every algebraic set over $G$ can be decomposed as a union of finitely many images of algebraic sets of NTQ systems. If the universal Horn theory of $G$ (the theory of quasi-identities) is decidable, then our constructions are effective.
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard algebraic and semigroup theoretic constructions: subsemigroups, homomorphic images, direct products, Rees matrix semigroups, including Brandt semigroups, and Bruck--Reilly extensions. We also investigate the relationship with the property of being weakly right noetherian, which requires all right ideals of $S$ to be finitely generated.
We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as an investigation into the difference between strong and weak effective coherence for finitely presented groups.
A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected sub-polyhedra. We show that this condition is almost-equivalent to Brick's qsf property, which amounts to finding an exhaustion approximable by finite simply connected complexes, and also to the tame combability introduced and studied by Mihalik and Tschantz. We further observe that a number of standard constructions in group theory yield qsf groups and analyze sp…