Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind

[Top of Book] [Contents] [Next Chapter]

PatternClass

A permutation pattern class package

2.3

05/07/2017

Ruth Hoffmann
Email: [email protected]
Homepage: TODO
Address:
TODO

Steve Linton
Email: [email protected]
Homepage: http://sal.host.cs.st-andrews.ac.uk/
Address:
Steve Linton
School of Computer Science,
University of St. Andrews,
North Haugh,
St. Andrews,
Fife,
KY16 9SS,
SCOTLAND

Michael Albert
Email: [email protected]
Homepage: http://www.cs.otago.ac.nz/staff/michael.html
Address:
Michael Albert
Department of Computer Science,
University of Otago,
PO Box 56,
DUNEDIN 9054,
New Zealand,

Contents

2 Token Passing Networks

2.1 Specific TPN

  2.1-1 Parstacks
  2.1-2 Seqstacks
  2.1-3 BufferAndStack

3 Permutation Encoding

3.1 Encoding and Decoding

  3.1-1 RankEncoding
  3.1-2 RankDecoding
  3.1-3 SequencesToRatExp

4 From Networks to Automata

4.1-1 GraphToAut
4.1-2 ConstrainedGraphToAut

5 From Automata to Networks

  5.1-1 IsStarClosed
  5.1-2 Is2StarReplaceable
  5.1-3 IsStratified
  5.1-4 IsPossibleGraphAut

7 Some Permutation Essentials

7.1-1 PermComplement

7.2 Rank Encoding

7.2-1 IsRankEncoding

8 Properties of Permutations

8.1 Intervals in Permutations

8.1-1 IsInterval

8.2-1 IsSimplePerm

8.3 Point Deletion in Simple Permutations

  8.3-1 OnePointDelete
  8.3-2 TwoPointDelete
  8.3-3 PointDeletion

8.4 Block-Decomposition

8.4-1 Inflation
8.4-2 BlockDecomposition

8.5 Plus-Decomposability

8.5-1 IsPlusDecomposable

8.6 Minus-Decomposability

8.6-1 IsMinusDecomposable

8.7 Sums of Permutations

8.7-1 PermDirectSum
8.7-2 PermSkewSum

10 Miscellaneous functions

10.1 Permutation Inclusion Set

  10.1-1 InbetweenPermAutomaton
  10.1-2 InbetweenPermSet
  10.1-3 IsSubPerm

10.2 Automaton Manipulation

10.2-1 LoopFreeAut
10.2-2 LoopVertexFreeAut

[Top of Book] [Contents] [Next Chapter]

Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind

generated by GAPDoc2HTML