GAP 4.8.9 installation with standard packages -- copy to your CoCalc project to get it

1
  
2
  
3
                                  PatternClass 
4
  
5
  
6
                      A permutation pattern class package 
7
  
8
  
9
                                      2.3
10
  
11
  
12
                                   05/07/2017
13
  
14
  
15
                                 Ruth Hoffmann
16
  
17
                                  Steve Linton
18
  
19
                                 Michael Albert
20
  
21
  
22
  
23
  Ruth Hoffmann
24
      Email:    mailto:[email protected]
25
      Homepage: TODO
26
      Address:  TODO
27
  
28
  
29
  Steve Linton
30
      Email:    mailto:[email protected]
31
      Homepage: http://sal.host.cs.st-andrews.ac.uk/
32
      Address:  Steve Linton
33
                School of Computer Science,
34
                University of St. Andrews,
35
                North Haugh,
36
                St. Andrews,
37
                Fife,
38
                KY16 9SS,
39
                SCOTLAND
40
  
41
  
42
  Michael Albert
43
      Email:    mailto:[email protected]
44
      Homepage: http://www.cs.otago.ac.nz/staff/michael.html
45
      Address:  Michael Albert
46
                Department of Computer Science,
47
                University of Otago,
48
                PO Box 56,
49
                DUNEDIN 9054,
50
                New Zealand,
51
  
52
  
53
  
54
  -------------------------------------------------------
55
  
56
  
57
  Contents (PatternClass)
58
  
59
  1 Introduction
60
  2 Token Passing Networks
61
    2.1 Specific TPN
62
      2.1-1 Parstacks
63
      2.1-2 Seqstacks
64
      2.1-3 BufferAndStack
65
  3 Permutation Encoding
66
    3.1 Encoding and Decoding
67
      3.1-1 RankEncoding
68
      3.1-2 RankDecoding
69
      3.1-3 SequencesToRatExp
70
  4 From Networks to Automata
71
    4.1 Functions
72
      4.1-1 GraphToAut
73
      4.1-2 ConstrainedGraphToAut
74
  5 From Automata to Networks
75
    5.1 Functions
76
      5.1-1 IsStarClosed
77
      5.1-2 Is2StarReplaceable
78
      5.1-3 IsStratified
79
      5.1-4 IsPossibleGraphAut
80
  6 Pattern Classes
81
    6.1 Transducers
82
      6.1-1 Transducer
83
      6.1-2 DeletionTransducer
84
      6.1-3 TransposedTransducer
85
      6.1-4 InvolvementTransducer
86
      6.1-5 CombineAutTransducer
87
    6.2 From Class to Basis and vice versa
88
      6.2-1 BasisAutomaton
89
      6.2-2 ClassAutomaton
90
      6.2-3 BoundedClassAutomaton
91
      6.2-4 ClassAutFromBaseEncoding
92
      6.2-5 ClassAutFromBase
93
      6.2-6 ExpandAlphabet
94
    6.3 Direct Sum of Regular Classes
95
      6.3-1 ClassDirectSum
96
    6.4 Statistical Inspections
97
      6.4-1 Spectrum
98
      6.4-2 NumberAcceptedWords
99
      6.4-3 AutStateTransitionMatrix
100
      6.4-4 AcceptedWords
101
      6.4-5 AcceptedWordsR
102
  7 Some Permutation Essentials
103
    7.1 Complement
104
      7.1-1 PermComplement
105
    7.2 Rank Encoding
106
      7.2-1 IsRankEncoding
107
  8 Properties of Permutations
108
    8.1 Intervals in Permutations
109
      8.1-1 IsInterval
110
    8.2 Simplicity
111
      8.2-1 IsSimplePerm
112
    8.3 Point Deletion in Simple Permutations
113
      8.3-1 OnePointDelete
114
      8.3-2 TwoPointDelete
115
      8.3-3 PointDeletion
116
    8.4 Block-Decomposition
117
      8.4-1 Inflation
118
      8.4-2 BlockDecomposition
119
    8.5 Plus-Decomposability
120
      8.5-1 IsPlusDecomposable
121
    8.6 Minus-Decomposability
122
      8.6-1 IsMinusDecomposable
123
    8.7 Sums of Permutations
124
      8.7-1 PermDirectSum
125
      8.7-2 PermSkewSum
126
  9 Regular Languages of Sets of Permutations
127
    9.1 Inversions in Permutations
128
      9.1-1 InversionAut
129
      9.1-2 InversionAutOfClass
130
    9.2 Plus- and Minus-(In)Decomposablilty
131
      9.2-1 PlusDecomposableAut
132
      9.2-2 PlusIndecomposableAut
133
      9.2-3 MinusDecomposableAut
134
      9.2-4 MinusIndecomposableAut
135
    9.3 Language of all non-simple permutations
136
      9.3-1 LengthBoundAut
137
      9.3-2 ShiftAut
138
      9.3-3 NextGap
139
      9.3-4 GapAut
140
      9.3-5 SumAut
141
      9.3-6 GapSumAut
142
      9.3-7 NonSimpleAut
143
    9.4 Simplicity
144
      9.4-1 SimplePermAut
145
    9.5 Exceptionality
146
      9.5-1 IsExceptionalPerm
147
      9.5-2 ExceptionalBoundedAutomaton
148
  10 Miscellaneous functions
149
    10.1 Permutation Inclusion Set
150
      10.1-1 InbetweenPermAutomaton
151
      10.1-2 InbetweenPermSet
152
      10.1-3 IsSubPerm
153
    10.2 Automaton Manipulation
154
      10.2-1 LoopFreeAut
155
      10.2-2 LoopVertexFreeAut
156
  
157
  
158
  
159
   
160
  
161

162