فهرست مطالب

International Journal of Group Theory
Volume:3 Issue: 1, Mar 2014

  • تاریخ انتشار: 1392/05/10
  • تعداد عناوین: 6
|
  • Benjamin Fine, Martin Kreuzer, Gerhard Rosenberger Pages 1-8
    In [FR 1,2] using faithful complex representations of cyclically pinched and conjugacy pinched one-relator groups we proved that any limit group has a faithful representation in PSL(2;C). Further this representation can be e ec- tively constructed using the JSJ decomposition. In this note we show that any hyperbolic cyclically pinched one-relator group with maximal amalgamated subgroups in each factor has a 2-dimensional faithful real representation.
    Keywords: hyperbolic group, limit group, faithful representation
  • Francesco De Giovanni, Marco Trombetti Pages 9-16
    A result of Dixon, Evans and Smith shows that if $G$ is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian, then $G$ itself has this property, i.e. the commutator subgroup of~$G$ has finite rank. It is proved here that if $G$ is a locally (soluble-by finite) group whose proper subgroups have minimax commutator subgroup, then also the commutator subgroup $G''$ of $G$ is minimax. A corresponding result is proved for groups in which the commutator subgroup of every proper subgroup has finite torsion-free rank.
    Keywords: minimax group, commutator subgroup, torsion, free rank
  • Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson Pages 17-30
    There is much interest in finding short presentations for the finite simple groups. Indeed it has been suggested that all these groups are efficient in a technical sense. In previous papers we produced nice efficient presentations for all except one of the simple groups with order less than one million. Here we show that all simple groups with order between 1 million and 5 million are efficient by giving efficient presentations for all of them. Apart from some linear groups these results are all new. We also show that some covering groups and some larger simple groups are efficient. We make substantial use of systems for computational group theory and, in particular, of computer implementations of coset enumeration to find and verify our presentations.
    Keywords: Efficient presentations, simple groups, coset enumeration
  • Barry Hurley, Ted Hurley Pages 31-56
    Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the structures are obtained and proofs given. Paraunitary matrices play a central role in signal processing, in particular in the areas of filterbanks and wavelets.
    Keywords: paraunitary, idempotent, multidimensional
  • Nguyen Tien Quang, Doan Trong Tuyen, Nguyen Thi Thu Thuy Pages 57-64
    The aim of this paper is to study co-prolongations of central extensions. We construct the obstruction theory for co-prolongations and classify the equivalence classes of these by kernels of a homomorphisms between 2-dimensional cohomology groups of groups.
    Keywords: group extension, cohomology of groups, prolongation, obstruction
  • Reza Orfi Pages 65-72
    Let G be a non-abelian group of order p^n, where n ≤ 5 in which G is not extra special of order p^5. In this paper we determine the maximal size of subsets X of G with the property that xy is not equal to yx for any distinct x, y in X.
    Keywords: p, group, AC, group, Pairwise non, commuting elements