Mottled
发表于 2025-3-21 18:14:10
书目名称Algorithms and Classification in Combinatorial Group Theory影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0153102<br><br> <br><br>书目名称Algorithms and Classification in Combinatorial Group Theory读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0153102<br><br> <br><br>
包裹
发表于 2025-3-21 23:20:14
,Automatic Groups and Amalgams — A Survey,where, in due course.) Most of these results are concerned with the construction of new automatic and asynchronously automatic groups from old by means of amalgamated products. Our secondary objective here is to survey a little of the theory of automatic groups and the like, keeping the account reasonably self-contained.
GREG
发表于 2025-3-22 03:06:18
http://reply.papertrans.cn/16/1532/153102/153102_3.png
可商量
发表于 2025-3-22 05:08:11
Problems on Automatic Groups,ntributed suggestions after the first draft was circulated. He remarked that a notion of automatic groups was considered by Russian writers in the 1970’s; it is important to point out that this earlier notion has nothing to do with the notion introduced in , which is the subject of this problem set.
AGONY
发表于 2025-3-22 10:47:35
https://doi.org/10.1007/978-1-4613-9730-4Group theory; algorithms; classification; combinatorial geometry; combinatorics
maroon
发表于 2025-3-22 13:09:19
http://reply.papertrans.cn/16/1532/153102/153102_6.png
欢呼
发表于 2025-3-22 19:20:41
https://doi.org/10.1007/978-1-84882-539-0mples of infinite simple groups. For example, let .. be any non-trivial torsion free group. Then, by , there exists a torsion free group C., containing .., in which the non-trivial elements of .. are all conjugate to each other. For . ∈ ℤ define ... = C. and let . = ∪.C.. Then . is an infinite si
食草
发表于 2025-3-22 21:50:06
http://reply.papertrans.cn/16/1532/153102/153102_8.png
单色
发表于 2025-3-23 04:49:04
The School Mathematical Education,ssifying space of . down to a quotient complex (typically “small”) of the same homotopy type. If the rewriting system is finite, then the quotient complex has only finitely many cells in each dimension. The proof yields an explicit free resolution of . over .., similar to resolutions obtained by Ani
歌曲
发表于 2025-3-23 07:07:06
Yunqiang Yin,Dujuan Wang,T. C. E. Cheng yields, via a theorem of Ken Brown, a proof that automatic groups are finitely presented and of type ... We also characterize hyperbolic groups in terms of combings, and discuss the relationship between the combings considered here and isoperimetric inequalities.