Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Permutation involvement and groups M.D. Atkinson
 

Summary: Permutation involvement and groups
M.D. Atkinson
Department of Computer Science
University of Otago
Dunedin, New Zealand
mike@cs.otago.ac.nz
Robert Beals
Department of Mathematics, University of Arizona
617 North Santa Rita, Tucson, Arizona 85721, USA
beals@math.arizona.edu
Abstract
Sets of permutations which are closed under both pattern involvement
and multiplication are classi ed.
Keywords Permutation, forbidden, restricted, group
1 Introduction
Over the last few years there has been much interest in both combinatorics
and computer science in the notion of permutation involvement. Although we
shall often use cycle notation for permutations, involvement is best described by
writing permutations  in image form as a sequence [1  ; 2  ; : : : ]. We recall that
a permutation  is involved in a permutation  if, when written in image form,

  

Source: Atkinson, Mike - Department of Computer Science, University of Otago

 

Collections: Computer Technologies and Information Sciences