首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
It is proved that in any finite representation of any finitely generated nilpotent group of nilpotency class l ⩾ 1, the averaged Dehn function σ(n) is subasymptotic w.r.t. the function nl+1. As a consequence it is stated that in every finite representation of a free nilpotent group of nilpotency class l of finite rank r ⩾ 2, the Dehn function σ(n) is Gromov subasymptotic. Supported by RFBR grant No. 04-01-00489. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 60–74, January–February, 2007.  相似文献   

2.
For finite rank free abelian groups with the standard presentation, the averaged Dehn function is proved to be subquadratic.  相似文献   

3.
Robert Young 《Topology》2008,47(5):351-367
Gromov proposed an averaged version of the Dehn function and claimed that in many cases it should be subasymptotic to the Dehn function. Using results on random walks in nilpotent groups, we confirm this claim for most nilpotent groups. In particular, if a nilpotent group satisfies the isoperimetric inequality δ(l)<Clα for α>2, then it satisfies the averaged isoperimetric inequality . In the case of non-abelian free nilpotent groups, the bounds we give are asymptotically sharp.  相似文献   

4.
We introduce a new invariant of bipartite chord diagrams and use it to construct the first examples of groups with Dehn function n2log n. Some of these groups have undecidable conjugacy problem. Our groups are multiple HNN extensions of free groups. We show that n2log n is the smallest Dehn function of a multiple HNN extension of a free group with undecidable conjugacy problem. Both authors were supported in part by the NSF grants DMS 0245600 and DMS 0455881. In addition, the research of the first author was supported in part by the Russian Fund for Basic Research 05-01-00895, the research of the second author was supported in part by the NSF grant DMS 9978802 and the US-Israeli BSF grant 1999298. Received: February 2005; Revision: September 2005; Accepted: September 2005  相似文献   

5.
If G is a hyperbolic group (resp. synchronously or asynchronously automatic group) which can be expressed as an extension of a finitely presented group H by a finitely generated free group, then the normal subgroup H satisfies a polynomial isoperimetric inequality (resp. exponential isoperimetric inequality).  相似文献   

6.
We show that the averaged Dehn function with respect to each finite presentation of an arbitrary finitely generated class 2 nilpotent group is subcubic. For the finite rank 2 free class 2 nilpotent group this implies the subasymptoticity of the averaged Dehn function in the sense of M. Gromov, confirming his conjecture.Original Russian Text Copyright © 2005 Romankov V. A.The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00489) and the Scientific Program Universities of Russia of the Ministry for Education of the Russian Federation (Grant 362-05).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 663–672, May–June, 2005.  相似文献   

7.
We prove that under some not overrestrictive assumptions the relative averaged Dehn function is bounded above and below by constants.  相似文献   

8.
王晓峰 《数学进展》2004,33(5):513-526
本文第一部分对组台群论的发展史作了一个简要的回顾.然后重点介绍近20年来组合群论领域中的三个热点课题:即双曲群,自动机群和群的Dehn函数的有关概念,并对相关的重要研究成果给予概述,其中包括作者本人在群的二阶Dehn函数的研究工作中的若干成果.最后提出9个公开问题。  相似文献   

9.
Let ε1 and ε2 belong to {±1}. When the ε1-surgery along a knot K1 in S3 produces the same homology sphere as the ε2-surgery along a knot K2 in S3, then the Casson surgery formula implies that ε1ΔK1″(1)=ε2ΔK2″(1), where Δ(t) denotes the symmetric Alexander polynomial. For any pair (Λ1(t),Λ2(t)) of possible knot Alexander polynomials such that ε1Λ1″(1)=ε2Λ2″(1), we exhibit a pair (K1,K2) of knots in S3 such that ΔK1(t)=Λ1(t), ΔK2(t)=Λ2(t) and the ε1-surgery along K1 produces the same homology sphere as the ε2-surgery along K2.  相似文献   

10.
A left-cancellative automatic monoid having directed fellow traveller property is finitely presented, and the first order Dehn functions of such automatic monoids are bounded above by a quadratic function. These results coincide with those of automatic groups. The research of X. Wang was partially supported by China National Science Funds (No:10771077 and 10671114).  相似文献   

11.
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word problem for a group presentation defined by a decidable set of defining words and the property of being computable for one of the newly introduced functions (this equivalence fails for the standard Dehn function). Elaborating on this equivalence and making use of this function, we obtain a characterization of finitely generated groups for which the word problem can be solved in nondeterministic polynomial time. We also give upper bounds for these functions, as well as for the standard Dehn function, for two well-known periodic groups. In particular, we prove that the (standard) Dehn function of a 2-group Γ of intermediate growth, defined by a system of defining relators due to Lysenok, is bounded from above by C1x2 log2 x, where C1 > 1 is a constant. We also show that the (standard) Dehn function of a free m-generator Burnside group B(m, n) of exponent n ≥ 248, where n is either odd or divisible by 29, defined by a minimal system of defining relators, is bounded from above by the subquadratic function x19/12. Received: September 2007, Revision: March 2008, Accepted: March 2008  相似文献   

12.
It is shown that there exist infinitely many non-integers such that the Dehn function of some finitely presented group is . Explicit examples of such groups are constructed. For each rational number pairs of finitely presented groups are constructed so that the distortion of in is .

  相似文献   


13.
A Dehn twist automorphism of a group G is an automorphism which can be given (as specified below) in terms of a graph-of-groups decomposition of G with infinite cyclic edge groups. The classic example is that of an automorphism of the fundamental group of a surface which is induced by a Dehn twist homeomorphism of the surface. For , a non-abelian free group of finite rank n, a normal form for Dehn twist is developed, and it is shown that this can be used to solve the conjugacy problem for Dehn twist automorphisms of . Received: February 12, 1996.  相似文献   

14.
The research launched in [1] is brought to a close by examining algebraic sets in a metabelian group G in two important cases: (1) G = Fn is a free metabelian group of rank n; (2) G = Wn,k is a wreath product of free Abelian groups of ranks n and k. Supported by RFBR grant No. 05-01-00292. __________ Translated from Algebra i Logika, Vol. 46, No. 4, pp. 503–513, July–August, 2007.  相似文献   

15.
Sungmo Kang 《Topology》2008,47(5):277-315
If a simple 3-manifold M admits a reducible and a toroidal Dehn filling, the distance between the filling slopes is known to be bounded by three. In this paper, we classify all manifolds which admit a reducible Dehn filling and a toroidal Dehn filling with distance 3.  相似文献   

16.
Let G be a group and let n be a positive integer. A polynomial function in G is a function from G n to G of the form , where f(x 1, . . . , x n ) is an element of the free product of G and the free group of rank n freely generated by x 1, . . . , x n . There is a natural definition for the product of two polynomial functions; equipped with this operation, the set of polynomial functions is a group. We prove that this group is polycyclic if and only if G is finitely generated, soluble, and nilpotent-by-finite. In particular, if the group of polynomial functions is polycyclic, then necessarily it is nilpotent-by-finite. Furthermore, we prove that G itself is polycyclic if and only if the subgroup of polynomial functions which send (1, . . . , 1) to 1 is finitely generated and soluble.   相似文献   

17.
The following question was asked by V. V. Bludov in The Kourovka Notebook in 1995: If a torsion-free group has a finite system of generators , ..., such that every element of has a unique presentation in the form where , is it true that is virtually polycyclic? The answer is ``not always.' A counterexample is constructed in this paper as a group presented by generators and defining relations.

  相似文献   


18.
For partially commutative metabelian groups, annihilators of elements of commutator subgroups are described; canonical representations of elements are defined; approximability by torsion-free nilpotent groups is proved; centralizers of elements are described. Also, it is proved that two partially commutative metabelian groups have equal elementary theories iff their defining graphs are isomorphic, and that every partially commutative metabelian group is embeddable in a metabelian group with decidable universal theory. Dedicated to V. N. Remeslennikov on the occasion of his 70th birthday Supported by RFBR (project No. 09-01-00099). Translated from Algebra i Logika, Vol. 48, No. 3, pp. 309–341, May–June, 2009.  相似文献   

19.
Necessary and sufficient conditions for the center of a metabelian group with one defining relation to be nontrivial are found. The center of such a group is described. The center of a group of the formF/Ng F is studied under certain conditions. By means of a new technique, the recent result of A. F. Krasnikov and the author on the center of a group of the above form is sharpened.Translated fromMatematickeskie Zametki, Vol. 64, No. 6, pp. 925–931, December, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-01948.  相似文献   

20.
We show that with the exception of four known cases: C3, C4, C5, and , all regular permutation groups can be represented as symmetric groups of boolean functions. This solves the problem posed by A. Kisielewicz in the paper [A. Kisielewicz, Symmetry groups of boolean functions and constructions of permutation groups, J. Algebra 199 (1998) 379-403]. A slight extension of our proof yields the same result for semiregular groups.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号