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 to a range of presentations. Our main focus is on 2-generator 1-relator presentations where we have a complete picture of largeness if the relator has exponent sum zero in one generator and word length at most 12, as well as when the relator is in the commutator subgroup and has word length at most 18. Indeed all but a tiny number of presentations define large groups. Finally we look at fundamental groups of closed hyperbolic 3-manifolds, where the algorithm readily determines that a quarter of the groups in the Snappea closed census are large.
We show that the Basilica Thompson group introduced by Belk and Forrest is not finitely presented, and in fact is not of type FP_2. The proof involves developing techniques for proving non-simple connectedness of certain subcomplexes of CAT(0) cube complexes.
We answer a question due to A. Myasnikov by proving that all expected ranks occur as the ranks of intersections of finitely generated subgroups of free groups.
Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups there exist a triangular algebra A such that all Gi appear as fundamental group of some presentation of A, extending one of the result in arXiv:math/0405127v3 [math.RA]
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves in a complicated way with respect to the lattice operations but can be recognized by a simple algorithm. The method results in a short proof of the theorem of E. Lee that every monoid that satisfies xtxysy = xtyxsy and xytxsy = yxtxsy is finitely based. Also, the method gives an alternative proof of the theorem of F. Blanchet-Sadri that a pseudovariety of n-…
We prove that the growth rate of an endomorphism of a finitely generated nilpotent group equals to the growth rate of induced endomorphism on its abelinization, generalizing the corresponding result for an automorphism in [14]. We also study growth rates of endomorphisms for specific solvable groups, lattices of Sol, providing a counterexample to a known result in [5] and proving that the growth rate is an algebraic number.
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.
Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually torsion-free-nilpotent groups of the same nilpotent genus such that one is finitely presented and the other is not. (ii) There exists a pair of finitely presented, residually torsion-free-nilpotent groups of the same nilpotent genus such that one has a solvable conjugacy problem and the other does not. (iii) There exists a pair of finitely generated, residually torsion-fre…
We describe a case of an interplay between human and computer proving which played a role in the discovery of an interesting mathematical result. The unusual feature of the use of computers here was that a computer generated but human readable proof was read, understood, generalized and abstracted by mathematicians to obtain the key lemma in an interesting mathematical result.
It is known that any locally graded group with finitely many derived subgroups of non-normal subgroups is finite-by-abelian. This result is generalized here, by proving that in a locally graded group $G$ the subgroup $γ_{k}(G)$ is finite if the set $\{γ_{k}(H)\;|\;H\ntriangleleft G\}$ is finite. Moreover, locally graded groups with finitely many $k$th terms of lower central series of infinite non-normal subgroups are also completely described.
We generalize the Plesken-Fabiańska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the invariant ring of $\mathrm{GL}(2, K)$ on $m$ copies of $\mathrm{SL}(2, K)$ by simultaneous conjugation. By giving this description, we generalize and simplify some of the known results in invariant theory. An implementation of the algorithm is available in the computer algebra system Magma.
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general computational approach for investigating finitely presented groups by way of quotients and subgroups is described and examples are presented. The techniques can provide detailed information about group structure. Under suitable circumstances a finitely presented group can be shown to be soluble and its complete derived series can be determined, using what is in effect a…
For all but finitely many compact orientable surfaces, we show that any superinjective map from the complex of separating curves into itself is induced by an element of the extended mapping class group. We apply this result to proving that any finite index subgroup of the Johnson kernel is co-Hopfian. Analogous properties are shown for the Torelli complex and the Torelli group.
A group $Γ$ is said to be periodic if for any $g$ in $Γ$ there is a positive integer $n$ with $g^n=id$. We first prove that a finitely generated periodic group acting on the 2-sphere $\SS^2$ by $C^1$-diffeomorphisms with a finite orbit, is finite and conjugate to a subgroup of $\mathrm{O}(3,\R)$ and we use it for proving that a finitely generated periodic group of spherical diffeomorphisms with even bounded orders is finite. Finally, we show that a finitely generated periodic group of homeomorphisms of any orientable compact surface other than the 2-sphere or the 2-torus (which is the purpose …
If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We prove that this is an equivalence relation. It is a much coarser relation than isomorphism, our ultimate concern. It turns out that many of the groups in a given equivalence class share various properties including finite presentability. There are examples, such as the lamplighter group, where an equivalence class consists of a single isomorphism class and othe…
We introduce a new method of proving upper estimates of growth of finitely generated groups and constructing groups of intermediate growth using graphs of their actions. These estimates are of the form $\exp(n^α)$ for some $α<1$, and provide the first examples of such bounds for simple groups of intermediate growth.
If F is a finitely generated free group and ϕis an automorphism of F then the mapping torus of ϕadmits a quadratic isoperimetric inequality. This is the third and final paper in a series proving this theorem. The first two were math.GR/0211459 and math.GR/0507589.
In this note we address a question of Don Hadwin: "Which groups have strongly quasidiagonal C*-algebras?" In recent work we showed that all finitely generated virtually nilpotent groups have strongly quasidiagonal C*-algebras, while together with Carrión and Dadarlat we showed that most wreath products fail to have strongly quasidiagonal C*-algebras. These two results raised the question of whether or not strong quasidiagonality could characterize virtual nilpotence among finitely generated groups. The purpose of this note is to provide examples of finitely generated groups (in fact of the for…
We show that every finitely generated Artin-Tits group admits a finite Garside family, by introducing the notion of a low element in a Coxeter group and proving that the family of all low elements in a Coxeter system (W, S) with S finite includes S and is finite and closed under suffix and join with respect to the right weak order.
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free groups has poly-context-free word problem, and conjecture that the converse also holds. We prove our conjecture for several classes of soluble groups, including metabelian groups and torsion-free soluble groups, and present progress towards resolving the conjecture for soluble groups in general. Some of the techniques introduced for proving languages not to b…
In this paper we study geometric versions of Burnside's Problem and the von Neumann Conjecture. This is done by considering the notion of a translation-like action. Translation-like actions were introduced by Kevin Whyte as a geometric analogue of subgroup containment. Whyte proved a geometric version of the von Neumann Conjecture by showing that a finitely generated group is non-amenable if and only if it admits a translation-like action by any (equivalently every) non-abelian free group. We strengthen Whyte's result by proving that this translation-like action can be chosen to be transitive …
We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations $w=w_0\to...\to w_t= w'$; $s(n)$ bounds from above the tape space (or computer memory) sufficient to implement all such transitions $w\to...\to w'.$ One of the results obtained is the following criterion: A finitely generated semigroup $S$ has decidable word problem of polynomial space complexity if and only if $S$ is a subsemigroup of a finitely presented semigr…
For a finitely generated group $G$, let $H(G)$ denote Bowditch's taut loop length spectrum. We prove that if $G=(A\ast B) / \langle\!\langle \mathcal R \rangle\!\rangle $ is a $C'(1/12)$ small cancellation quotient of a the free product of finitely generated groups, then $H(G)$ is equivalent to $H(A) \cup H(B)$. We use this result together with bounds for cohomological and geometric dimensions, as well as Bowditch's construction of continuously many non-quasi-isometric $C'(1/6)$ small cancellation $2$-generated groups to obtain our main result: Let $\mathcal{G}$ denote the class of finitely ge…
We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.
We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use relations from $R$ for elementary transformations to obtain the empty word; $s(n)$ bounds from above the tape space (or computer memory) one needs to transform any word of length at most $n$ vanishing in $G$ to the empty word. One of the main obtained results is the following criterion: A finitely generated group $H$ has decidable word problem of polynomial space co…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed. This article is aimed at a broad mathematical audience, and more particularly at users of group-theoretical methods and computer algebra systems.
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive (possibly infinite) presentation, a so-called finite $L$-presentation. Finite $L$-presentations allow numerous algorithms for finitely presented groups to be generalized to this special class of recursive presentations. We give an overview of the algorithms for finitely $L$-presented groups. As applications, we demonstrate how their implementation in a computer al…
Boundary Dynamics, Cubical Actions, and Infinite Girth
Institute of Mathematics of the Polish Academy of Sciences（波兰科学院数学研究所）；Department of Mathematics School of Mathematical Sciences Ramakrishna Mission Vivekananda Educational & Research Institute (RKMVERI)（罗摩克里希那使命维韦卡南达教育与研究机构）；Department of Mathematics, Adams State University（阿达姆斯州立大学数学系）；HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利研究与创新网络阿尔弗雷德·雷尼数学研究所）
该研究开发两种从边界动力学证明无限围长的方法，结合 Nakamura 准则得到相关群及作用的无限围长结果，还证明有限生成 large 群均有无限围长，解答了他人提出的问题。
