activity
20012026
most citedBetween primitive and -transitive: Synchronization and its friends

59 citations · 338 across the 95 of their papers we have counts for

collaborators
Showing 2013Show all

5 papers · 1 filter

cs.CC2013★ 2 cited

Computing in matrix groups without memory

Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau

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…

cs.CC2013

Computing in permutation groups without memory

Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau

Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computat…

math.GR2013★ 1 cited

Permutation groups and transformation semigroups: results and problems

João Araújo, Peter J. Cameron

J.M. Howie, the influential St Andrews semigroupist, claimed that we value an area of pure mathematics to the extent that (a) it gives rise to arguments that are deep and elegant,…

math.CO2013★ 1 cited

Primitive Groups Synchronize Non-uniform Maps of Extreme Ranks

João Araújo, Peter J. Cameron

Let be a set of cardinality , a permutation group on , and a map which is not a permutation. We say that synchronizes if the semigroup $\langle G,f\…

math.GR2013

The Classification of Partition Homogeneous Groups with Applications to Semigroup Theory

Jorge André, João Araújo, Peter J. Cameron

Let be a \emph{partition} of , a sequence of positive integers in non-increasing order with sum . Let . An ordered partition $P=(A_1,A_2,...…