Filling Length in Finitely Presentable Groups

We study the filling length function for a finite presentation of a group , and interpret this function as an optimal bound on the length of the boundary loop as a van Kampen diagram is collapsed to the basepoint using a combinatorial notion of a null-homotopy. We prove that filling length is well behaved under change of presentation of . We look at 'AD-pairs' (f,g) for a finite presentation : that is, an isoperimetric function f and an isodiametric function g that can be realised simultaneously. We prove that the filling length admits a bound of the form [g+1][log (f+1)+1] whenever (f,g) is an AD-pair for . Further we show that (up to multiplicative constants) if is an isoperimetric function ( ) for a finite presentation then ( ) is an AD-pair. Also we prove that for all finite presentations filling length is bounded by an exponential of an isodiametric function.Partially supported by NSF grant DMS-9800158Supported by EPSRC Award No. 98001683 and Corpus Christi College, Oxford.     

Finitely Presented Subgroups of Automatic Groups and their Isoperimetric Functions

We describe a general technique for embedding certain amalgamatedproducts into direct products. This technique provides us witha way of constructing a host of finitely presented subgroupsof automatic groups which are not even asynchronously automatic.We can also arrange that such subgroups satisfy, at best, anexponential isoperimetric inequality.     

Abelian Subgroups of Finitely Generated Kleinian Groups are Separable

By a Kleinian group we mean a discrete subgroup of PSL(2, C).We prove that abelian subgroups of finitely generated Kleiniangroups are separable. In other words, if M = H³/ is a hyperbolic3-orbifold, with finitely generated, then abelian subgroupsof are separable in . 1991 Mathematics Subject Classification20E26, 51M10, 57M05.     

Finitely Generated Nilpotent Groups of Infinite Cyclic Commutator Subgroups

The aim of this paper is to determine the structure and to establish the isomorphic invariant of the finitely generated nilpotent group G of infinite cyclic commutator subgroup. Using the structure and invariant of the group which is the central extension of a cyclic group by a free abelian group of finite rank of infinite cyclic center, we provide a decomposition of G as the product of a generalized extraspecial Z-group and its center. By using techniques of lifting isomorphisms of abelian groups and equivalent normal form of the generalized extraspecial Z-groups, we finally obtain the structure and invariants of the group G.     

Frattini子群是无限循环群的有限生成幂零群

完整地确定了Frattini子群是无限循环群的有限生成幂零群的结构,证明了下面的定理.设G是有限生成幂零群,则G的Frattini子群是无限循环群当且仅当G可以分解为G=S×F×T,其中F是秩为s的自由Abel群,T=Z_m_1⊕Zm_2⊕…⊕Z_m_u,m_1,m_2,…,m_u都是大于1的没有平方因子的自然数,m_1|m_2|…|m_u,■式中d_1,d_2,…,d_r都是正整数,d_1|d_2|…|d_r.进一步,(d_1,d2,…,d_r;s;m_1…,m_2,…,m_u)是群G的同构不变量,即若群H也是Frattini子群是无限循环群的有限生成幂零群,那么G同构于H的充要条件是它们有相同的不变量.     

On Subgroups of Finite Index in Positively Finitely Generated Groups

This paper proves that a subgroup of finite index in a positivelyfinitely generated profinite group has maximal subgroup growthat most n^log(n). In particular such a subgroup cannot be free,answering a question by L. Pyber. 2000 Mathematics Subject Classification20E28, 20P05.     

典型群的正规子群和同余子群问题

正规子群和同余子群问题,是研究典型群的一个重要方向。(参见文献[1—7]。)这个问题的研究,最初是为了确定典型群的正规群列,并找出典型群系列中的单群。现在研究这个问题,主要是为了搞清环上典型群的构造,以及自同构和同构问题。本文对近年来这方面的结果进行综述,并讨论其发展方向。     

On Certain Automorphism Groups of Finitely Generated Groups

Mathematical Notes -     

Powers in Finitely Generated Groups

In this paper we study the set of -powers in certain finitely generated groups . We show that, if is soluble or linear, and contains a finite index subgroup, then is nilpotent-by-finite. We also show that, if is linear and has finite index (i.e. may be covered by finitely many translations of ), then is soluble-by-finite. The proof applies invariant measures on amenable groups, number-theoretic results concerning the -unit equation, the theory of algebraic groups and strong approximation results for linear groups in arbitrary characteristic.

     

Embedding Free Burnside Groups in Finitely Presented Groups

We construct an embedding of a free Burnside group B(m,n) of odd exponent n > 2⁴⁸ 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 nonamenable groups without noncyclic free subgroups (which provides a new finitely presented counterexample to the von Neumann problem on amenable groups). As another application, we construct weakly finitely presented groups of odd exponent n ≫ 1 which are not locally finite.     

Asymptotic Cones of Finitely Generated Groups

Answering a question of Gromov [7], we shall present an exampleof a finitely generated group and two non-principal ultrafiltersA, B such that the asymptotic cones Con_A and Con_B are nothomeomorphic. 1991 Mathematics Subject Classification 20F06,20F32.     

Nilpotent Subgroups of Groups with All Subgroups Subnormal

It is proved that in groups with all subgroups subnormal everynilpotent subgroup is contained in a normal nilpotent subgroup.     

On Subgroups and Quotient Groups of L-fuzzy Topological Groups

In paper [1], it gave the concept and basic properties of L-fuzzy topological groups. This paper will enter the concept of quotient groups of L-fuzzy topological groups and will prove some properties of subgroups and quotient groups. The persent work is the continuation of [1] and hence all the conventions in [1] still hold good in the present paper.     

多重循环群的Fitting子群

本文给出了多重循环群的Ｆｉｔｉｎｇ子群的几条性质，所得结果深化了Ｍａｌｃｅｖ关于多重循环群的经典工作．     

On Isoperimetric Profiles of Finitely Generated Groups

We find up to multiplicative constant isoperimetric profiles of wreath products and related groups. Those are the first examples where the explicitly calculated asymptotics of isoperimetric profile is neither polynomial nor exponential.     

Collectives of Automata in Finitely Generated Groups

Mathematical Notes - The present paper is devoted to traversing a maze by a collective of automata. This part of automata theory gave rise to a fairly wide range of diverse problems ([1], [2]),...     

Palindromic Width of Finitely Generated Solvable Groups

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated 3-step solvable group has finite palindromic width. More generally, we show the finiteness of the palindromic width for finitely generated abelian-by-nilpotent-by-nilpotent groups. For arbitrary solvable groups of step ≥3, we prove that if G is a finitely generated solvable group that is an extension of an abelian group by a group satisfying the maximal condition for normal subgroups, then the palindromic width of G is finite. We also prove that the palindromic width of ??? with respect to the set of standard generators is 3.