Now showing items 1-4 of 4

  • Computing in matrix groups without memory 

    Cameron, Peter Jephson; Fairbairn, Ben; Gadouleau, Maximilien (2014-11-02) - Journal article
    Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they ...
  • Generation problems for finite groups 

    McDougall-Bagnall, Jonathan M. (University of St Andrews, 2011-11-30) - Thesis
    It can be deduced from the Burnside Basis Theorem that if G is a finite p-group with d(G)=r then given any generating set A for G there exists a subset of A of size r that generates G. We have denoted this property B. A ...
  • Groups with the basis property 

    McDougall-Bagnall, Jonathan M.; Quick, Martyn (2011-11-15) - Journal article
    We study finite groups for which every minimal generating set has the same cardinality. A group has the basis property if it and every subgroup satisfies this condition on minimal generating sets. We classify all finite ...
  • Growth of generating sets for direct powers of classical algebraic structures 

    Quick, Martyn; Ruskuc, Nik (2010-08) - Journal article
    For an algebraic structure A denote by d(A) the smallest size of a generating set for A, and let d(A)=(d(A),d(A2),d(A3),…), where An denotes a direct power of A. In this paper we investigate the asymptotic behaviour of the ...