本刊英文版2014年57卷第9期摘要

On variations of m, n-simply presented abelian p-groups     

Betti numbers of finitely presented groups and very rapidly growing functions

Define the length of a finite presentation of a group G as the sum of lengths of all relators plus the number of generators. How large can the kth Betti number b_k(G)= rank H_k(G) be providing that G has length ≤N and b_k(G) is finite? We prove that for every k≥3 the maximum b_k(N) of the kth Betti numbers of all such groups is an extremely rapidly growing function of N. It grows faster that all functions previously encountered in mathematics (outside of logic) including non-computable functions (at least those that are known to us). More formally, b_k grows as the third busy beaver function that measures the maximal productivity of Turing machines with ≤N states that use the oracle for the halting problem of Turing machines using the oracle for the halting problem of usual Turing machines.We also describe the fastest possible growth of a sequence of finite Betti numbers of a finitely presented group. In particular, it cannot grow as fast as the third busy beaver function but can grow faster than the second busy beaver function that measures the maximal productivity of Turing machines using an oracle for the halting problem for usual Turing machines. We describe a natural problem about Betti numbers of finitely presented groups such that its answer is expressed by a function that grows as the fifth busy beaver function.Also, we outline a construction of a finitely presented group all of whose homology groups are either or trivial such that its Betti numbers form a random binary sequence.     

Seifert manifolds and (1, 1)-knots

The aim of this paper is to investigate the relations between Seifert manifolds and (1, 1)-knots. In particular, we prove that each orientable Seifert manifold with invariants

$\{ Oo,0| - 1;\underbrace {(p,q),...,(p,q)}_{n times},(l,l - 1)\} $

has the fundamental group cyclically presented by G _n ((x ₁ ^q ...x _n ^{q l} x _n ^?p ) and, moreover, it is the n-fold strongly-cyclic covering of the lens space L(|nlq ? p|, q) which is branched over the (1, 1)-knot K(q, q(nl ? 2), p ? 2q, p ? q) if p ≥ 2q and over the (1, 1)-knot K(p? q, 2q ? p, q(nl ? 2), p ? q) if p< 2q.

     

Average-case complexity and decision problems in group theory

We investigate the average-case complexity of decision problems for finitely generated groups, in particular, the word and membership problems. Using our recent results on “generic-case complexity”, we show that if a finitely generated group G has word problem solvable in subexponential time and has a subgroup of finite index which possesses a non-elementary word-hyperbolic quotient group, then the average-case complexity of the word problem of G is linear time, uniformly with respect to the collection of all length-invariant measures on G. This results applies to many of the groups usually studied in geometric group theory: for example, all braid groups B_n, all groups of hyperbolic knots, many Coxeter groups and all Artin groups of extra-large type.     

Fibre products, non-positive curvature, and decision problems

We give a criterion for fibre products to be finitely presented and use it as the basis of a construction that encodes the pathologies of finite group presentations into pairs of groups where G is a product of hyperbolic groups and P is a finitely presented subgroup. This enables us to prove that there is a finitely presented subgroup P in a biautomatic group G such that the generalized word problem for is unsolvable and P has an unsolvable conjugacy problem. An additional construction shows that there exists a compact non-positively curved polyhedron X such that is biautomatic and there is no algorithm to decide isomorphism among the finitely presented subgroups of . Received: October 7, 1999.     

Adian-Lisenok groups and (U) condition

A group G possesses the property (U) with respect to S if there exists a number M = M(G) such that for each generating set P of the group G there exists an element t ? G for which max _x?S |t ^?1 xt| _P ≤ M. It is proved that the well-known Adian-Lisenok groups possess the property (U). In connection with the problem on finding infinite groups with the property (U), which is stated in a joint unpublishedwork by D.Osin and D. Sonkin, it is shown that for any odd n ≥ 1003 there is a continuum set of non-isomorphic, i.e. simple groups with the property (U) in the variety of groups satisfying the identity x ⁿ = 1.     

Classes of Subgroups of Simply Presented Primary Abelian Groups

A class 𝒳 of abelian p-groups is closed under ω₁-bijective homomorphisms if whenever f: G → H is a homomorphism with countable kernel and cokernel, then G ∈ 𝒳 iff H ∈ 𝒳. For an ordinal α, we consider the smallest class with this property containing (a) the p ^α-bounded simply presented groups; (b) the p ^α-projective groups; (c) the subgroups of p ^α-bounded simply presented groups. This builds upon classical results of Nunke from [14 Nunke , R. ( 1963 ). Purity and subfunctors of the identity . In: Topics in Abelian Groups , Chicago : Scott, Foresman and Co. , pp. 121 – 171 . [Google Scholar]] and [15 Nunke , R. ( 1967 ). Homology and direct sums of countable abelian groups . Math. Z. 101 : 182 – 212 .[Crossref], [Web of Science ®] , [Google Scholar]]. Particular attention is paid to the separable groups in these classes.     

Abstract Commensurators of Groups Acting on Rooted Trees

We show that the abstract commensurator of a nearly level transitive weakly branch group H coincides with the relative commensurator of H in the homeomorphism group of the boundary of the tree on which H acts. It is also shown that the commensurator of an infinite group which is commensurable with its own nth direct power contains a Higman–Thompson group as a subgroup. Applying these results to the Grigorchuk 2-group G we show that the commensurator of G is a finitely presented infinite simple group.     

Isomorphism of Modular Group Algebras of p-Mixed Abelian Groups

Let A be a torsion-free abelian group and F a free subgroup of A. We prove that if A/F is a reduced p-group and A/(F + C) is reduced for every p-pure subgroup C of A, then A is free.

Let KG be the group algebra of an abelian group G over a field K of prime characteristic p. Denote by S(KG) the p-component of the group V(KG) of normalized units of KG (of augmentation 1). Let H be an arbitrary group and KH ? KG as K-algebras. We prove the following. First, assume that G is a splitting group, the p-component G _p of G is simply presented, and the field K is perfect. Then H _p  ? G _p . If, in addition, G is p-mixed, then G _p is a direct factor of S(KG), and G is a direct factor of V(KG), each with the same simply presented complement. Secondly, we introduce a class of special p-mixed abelian groups and prove that, if G belong to this class, then any group basis of the group algebra KG splits. Besides, H is p-mixed and splits. Thirdly, if G is a special p-mixed abelian group and G _p is a reduced totally projective p-group, then H ? G. These results correct some essential inaccuracies and incompleteness in the proofs of results in this direction of Danchev [3-8 Danchev , P. V. ( 1998 ). Isomorphism of commutative group algebras of mixed splitting groups . Compt. Rend. Acad. Bulg. Sci. 51 : 13 – 16 . Danchev , P. V. ( 2000 ). Isomorphism of modular group algebras of totally projective abelian groups . Communications in Algebra 28 : 2521 – 2531 . Danchev , P. V. ( 2001 ). On a question of W. L. May concerning the isomorphism of modular group algebras . Communications in Algebra 29 : 1953 – 1958 . Danchev , P. V. ( 2001 ). Normed units in Abelian group rings . Glasg. Math. J. 43 : 365 – 373 . Danchev , P. V. ( 2002 ). Invariants for group algebras of splitting abelian groups with simply presented components . Compt. Rend. Acad. Bulg. Sci. 55 : 5 – 8 . Danchev , P. V. ( 2004 ). A note on the isomorphic modular group algebras of abelian groups with simply presented p-components . Compt. Rend. Acad. Bulg. Sci. 57 : 13 – 14 . ].     

2-Selmer groups and the Birch-Swinnerton-Dyer Conjecture for the congruent number curves

We take an approach toward counting the number of integers n for which the curve En: y²=x³−n²x has 2-Selmer groups of a given size. This question was also discussed in a pair of papers by Roger Heath-Brown. In contrast to earlier work, our analysis focuses on restricting the number of prime factors of n. Additionally, we discuss the connection between computing the size of these Selmer groups and verifying cases of the Birch and Swinnerton-Dyer Conjecture. The key ingredient for the asymptotic formulae is the “independence” of the Legendre symbol evaluated at the prime divisors of an integer with exactly k prime factors.     

Recognition of subgroups of direct products of hyperbolic groups

We give examples of direct products of three hyperbolic groups in which there cannot exist an algorithm to decide which finitely presented subgroups are isomorphic.

     

Polytopes of high rank for the alternating groups

There is a well-known correspondence between abstract regular polytopes and string C-groups. In this paper, for each d?3, a string C-group with d generators, isomorphic to an alternating group of degree n is constructed (for some n?9), or equivalently an abstract regular d-polytope, is produced with automorphism group Alt(n). A method that extends the CPR graph of a polytope to a different CPR graph of a larger (or possibly isomorphic) polytope is used to prove that various groups are themselves string C-groups.     

On Groups Generated by Elements of Pirme Order

In the first part of the paper we give a characterization of groups generated by elements of fixed prime order p. In the second part we study the group G _n ^(p) of n × n matrices with the pth power of the determinant equal to 1 over a field F containing a primitive pth root of 1. It is known that the group G _n ⁽²⁾ of n × n matrices of determinant ± 1 over a field F and the group SL _n (F) are generated by their involutions and that each element in these groups is a product of four involutions. We consider some subgroups G of G _n ^(p) and study the following problems: Is G generated by its elements of order p? If so, is every element of G a product of k elements of order p for some fixed integer k? We show that G _n ^(p) and SL _n (F) are generated by their elements of order p and that the bound k exists and is equal to 4. We show that every universal p-Coxeter group has faithful two-dimensional representations over many fields F (including ? and ?). For a universal p-Coxeter group of rank ≥ 2 for p ≥ 3 or of rank ≥ 3 for p = 2 there is no bound k.     

Permutation polytopes and indecomposable elements in permutation groups

Each group G of n×n permutation matrices has a corresponding permutation polytope, P(G):=conv(G)⊂Rn×n. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then min{2t,⌊n/2⌋} is a sharp upper bound on the diameter of the graph of P(G). We also show that P(G) achieves its maximal dimension of ²(n−1) precisely when G is 2-transitive. We then extend the results of Pak [I. Pak, Four questions on Birkhoff polytope, Ann. Comb. 4 (1) (2000) 83-90] on mixing times for a random walk on P(G). Our work depends on a new result for permutation groups involving writing permutations as products of indecomposable permutations.     

Some Properties of Bell Groups

For any integer n ≠ 0,1, a group G is said to be “n-Bell” if it satisfies the identity [x ⁿ ,y] = [x,y ⁿ ]. It is known that if G is an n-Bell group, then the factor group G/Z ₂(G) has finite exponent dividing 12n ⁵(n ? 1)⁵. In this article we show that this bound can be improved. Moreover, we prove that every n-Bell group is n-nilpotent; consequently, using results of Baer on finite n-nilpotent groups, we give the structure of locally finite n-Bell groups. Finally, we are concerned with locally graded n-Bell groups for special values of n.     

Applications and adaptations of the low index subgroups procedure

The low-index subgroups procedure is an algorithm for finding all subgroups of up to a given index in a finitely presented group and hence for determining all transitive permutation representations of of small degree. A number of significant applications of this algorithm are discussed, in particular to the construction of graphs and surfaces with large automorphism groups. Furthermore, three useful adaptations of the procedure are described, along with parallelisation of the algorithm. In particular, one adaptation finds all complements of a given finite subgroup (in certain contexts), and another finds all normal subgroups of small index in the group . Significant recent applications of these are also described in some detail.

     

Covering the alternating groups by products of cycle classes

Given integers k,l?2, where either l is odd or k is even, we denote by n=n(k,l) the largest integer such that each element of An is a product of k cycles of length l. For an odd l, k is the diameter of the undirected Cayley graph Cay(An,Cl), where Cl is the set of all l-cycles in An. We prove that if k?2 and l?9 is odd and divisible by 3, then . This extends earlier results by Bertram [E. Bertram, Even permutations as a product of two conjugate cycles, J. Combin. Theory 12 (1972) 368-380] and Bertram and Herzog [E. Bertram, M. Herzog, Powers of cycle-classes in symmetric groups, J. Combin. Theory Ser. A 94 (2001) 87-99].