Murray J Elder
In this article we prove that an "isometric multiple HNN-extension" of a group satisfying the falsification by fellow traveler property is almost convex. As a corollary, Wise's example of a CAT(0) non-Hopfian group is Almost convex.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let B_n be the braid group on n > 3 strands. We prove that B_n modulo its center is co-Hopfian. We then show that any injective endomorphism of B_n is geometric in the sense that it is induced by a homeomorphism of a punctured disk. We further prove that any injection from B_n to B_n+1 is geometric. Additionally, we obtain analogous results for mapping class groups of punctured spheres. The methods use Thurston's theory of surface homeomorphisms and build upon work of Ivanov and McCarthy.
On Some Versions of Hopficity for Abelian Groups
本文研究了阿贝尔群的几种霍普菲性质版本，包括余有限霍普菲群和几乎余有限霍普菲群，探讨了其定义和性质。
Let $H$ be a subgroup of a group $G$. A normal subgroup $N_H$ of $H$ is said to be inheritably normal if there is a normal subgroup $N_G$ of $G$ such that $N_H=N_G\cap H$. It is proved in the paper that a subgroup $N_{G_i}$ of a factor $G_i$ of the $n$-periodic product $\prod_{i\in I}^nG_i$ with nontrivial factors $G_i$ is an inheritably normal subgroup if and only if $N_{G_i}$ contains the subgroup $G_i^n$. It is also proved that for odd $n\ge 665$ every nontrivial normal subgroup in a given $n$-periodic product $G=\prod_{i\in I}^nG_i$ contains the subgroup $G^n$. It follows that almost all $…
The arguments of Cannon, Floyd, Grayson and Thurston showing that solve geometry groups are not almost convex also show that solvable Baumslag-Solitar groups are not almost convex.
We introduce the "loop shortening property" and the "basepoint loop shortening property" for finitely generated groups, and examine their relation to quadratic isoperimetric functions and almost convexity.
If $M$ is a closed Nil geometry 3-manifold then $π_1(M)$ is almost convex with respect to a fairly simple ``geometric'' generating set. If $G$ is a central extension or a ${\Bbb Z}$-extension of a word hyperbolic group, then $G$ is also almost convex with respect to some generating set. Combining these with previously known results shows that if $M$ is a closed 3-manifold with one of Thurston's eight geometries, $π_1(M)$ is almost convex with respect to some generating set if and only if the geometry in question is not Sol.
In this article we show that the Baumslag-Solitar group $BS(1,2)$ is minimally almost convex, or $MAC$. We also show that $BS(1,2)$ does not satisfy Poénaru's almost convexity condition $P(2)$, and hence the condition $P(2)$ is strictly stronger than $MAC$. Finally, we show that the groups $BS(1,q)$ for $q \geq 7$ and Stallings' non-$FP_3$ group do not satisfy $MAC$. As a consequence, the condition $MAC$ is not a commensurability invariant.
We prove that Richard Thompson's group F is not minimally almost convex with respect to the two standard generators. This improves upon a recent result of S. Cleary and J. Taback. We make use of the forest diagrams for elements of F introduced by J. Belk and K. Brown. These diagrams seem particularly well-suited for understanding the Cayley graph for the two standard generators.
We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define algorithmically stackable groups, for which this procedure is an algorithm. This property gives a common model for algorithms arising from both rewriting systems and almost convexity for groups.
We show that Thompson's group F does not satisfy Cannon's almost convexity condition AC(n) for any integer n in the standard finite two generator presentation. To accomplish this, we construct a family of pairs of elements at distance n from the identity and distance 2 from each other, which are not connected by a path lying inside the n-ball of length less than k for increasingly large k. Our techniques rely upon Fordham's method for calculating the length of a word in F and upon an analysis of the generators' geometric actions on the tree pair diagrams representing elements of F.
We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set. Namely, we explicitly construct such combings for Thompson's group F and the Baumslag-Solitar groups BS(1, p) with p \ge 3. In order to make this construction for Thompson's group F, we significantly expand the understanding of the Cayley complex of this group with respect to the standard finite presentation. In particular we describe a quasigeodesic set of normal forms and…
We prove that Thompson's group F is not minimally almost convex with respect to any generating set which is a subset of the standard infinite generating set for F and which contains x_1. We use this to show that F is not almost convex with respect to any generating set which is a subset of the standard infinite generating set.
A Cayley graph for $F_{2}\times F_{2}$ which is not minimally almost convex
本文构造了 $F_{2}\times F_{2}$ 的一个非极小几乎凸凯莱图，证明介于 FFTP 与 MAC 之间的凯莱图性质依赖于生成元集，并首次揭示 Poénaru 条件 $P(2)$、基点回路缩短性质及回路缩短性质同样依赖生成元集。
We prove that if the Cayley graph of a finitely generated group enjoys the property L_delta then the group is almost convex and has a sub-cubic isoperimetric function.
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are canonically associated with the corresponding subgroups. We show that this notion of Stallings graphs allows a unified approach to many algorithmic problems: some which had already been solved like the generalized membership problem or the computation of a quasi-convexity constant (Kapovich, 1996); and others such as the computation of intersections, the con…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。