Skip to content

Commit 1aabeba

Browse files
ruthhoffmannruthhoffmann
committed
Version 2.3 hopefully
1 parent 55b4037 commit 1aabeba

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

72 files changed

+9690
-3710
lines changed

‎README‎

Lines changed: 13 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -52,23 +52,30 @@ If you get 'PatternClass' as a compressed file unpack it in the pkg/ folder
5252
in the gap4r4 folder where GAP is installed on your computer.
5353
To uncompress the .tar.gz file on UNIX use the following command
5454

55-
tar xzf PatternClass2.2.tar.gz
55+
tar xzf PatternClass2.3.tar.gz
5656

5757
If your version of tar does not support the z option use
5858

59-
gunzip PatternClass2.2.tar.gz
60-
tar xf PatternClass2.2.tar
59+
gunzip PatternClass2.3.tar.gz
60+
tar xf PatternClass2.3.tar
6161

6262
This will create the folder PatternClass in pkg/ and within that
6363
you will find the directories and files mentioned above.
6464

6565
To use the package within GAP, run GAP and type the following
6666

67-
gap> LoadPackage("PatternClass");
67+
gap> LoadPackage("patternclass");
6868
----------------------------------------------------------------
69-
Loading PatternClass 2.2
70-
For help, type: ?PatternClass:
69+
Loading Automata 1.13
70+
For help, type: ?Automata:
7171
----------------------------------------------------------------
72+
─────────────────────────────────────────────────────────────────────────────
73+
Loading PatternClass 2.3 (A permutation pattern class package)
74+
by Ruth Hoffmann (TODO),
75+
Steve Linton (http://sal.host.cs.st-andrews.ac.uk/), and
76+
Michael Albert (http://www.cs.otago.ac.nz/staff/michael.html).
77+
Homepage: https://RuthHoffmann.github.io/PatternClass/
78+
─────────────────────────────────────────────────────────────────────────────
7279
true
7380
gap>
7481

‎doc/PatternClass.aux‎

Lines changed: 240 additions & 0 deletions
Large diffs are not rendered by default.

‎doc/PatternClass.bbl‎

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
\begin{thebibliography}{1}
2+
3+
\bibitem{PermGenTPGraph}
4+
M.~Atkinson, M.~Livesey, and D.~Tulley, ``Permutations generated by token
5+
passing in graphs,'' {\em Theoretical Computer Science}, vol.~178, pp.~103 --
6+
118, n.d.
7+
8+
\bibitem{RegCloSetPerms}
9+
M.~Albert, M.~Atkinson, and N.~Ru\v{s}kuc, ``Regular closed sets of
10+
permutations,'' {\em Theoretical Computer Science}, vol.~306, pp.~85 -- 100,
11+
2003.
12+
13+
\bibitem{FAlgsEnumAllCommIntsof2Perms}
14+
T.~Uno and M.~Yagiura, ``Fast algorithms to enumerate all common intervals of
15+
two permutations,'' {\em Algorithmica}, vol.~26, p.~2000, 2000.
16+
17+
\bibitem{SimpPermsPoset}
18+
A.~Pierrot and D.~Rossin, ``{Simple permutations poset},'' {\em ArXiv
19+
e-prints}, pp.~1--15, Jan. 2012.
20+
21+
\bibitem{SimpSurv}
22+
R.~Brignall, ``A survey of simple permutations,'' {\em ArXiv e-prints}, June
23+
2008.
24+
25+
\bibitem{SimpAndPRestrPerms}
26+
M.~Albert and M.~Atkinson, ``Simple permutations and pattern restricted
27+
permutations,'' {\em Discrete Mathematics}, vol.~300, no.~1--3, pp.~1 -- 15,
28+
2005.
29+
30+
\bibitem{UpBndStanWilf1324}
31+
A.~Claesson, V.~Jel{\'{i}}nek, and E.~Steingr{\'{i}}msson, ``{Upper bounds for
32+
the Stanley-Wilf limit of 1324 and other layered patterns},'' {\em ArXiv
33+
e-prints}, Nov. 2011.
34+
35+
\bibitem{RegLangPlusMinPerms}
36+
R.~Hoffmann and S.~Linton, ``{Regular Languages of Plus- and Minus-
37+
(In)Decomposable Permutations},'' {\em Pure Mathematics and Applications (to
38+
appear)}, 2013.
39+
40+
\end{thebibliography}

‎doc/PatternClass.blg‎

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
This is BibTeX, Version 0.99d (TeX Live 2015/Debian)
2+
Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
3+
The top-level auxiliary file: PatternClass.aux
4+
The style file: ieeetr.bst
5+
Database file #1: bibliography.bib.bib
6+
You've used 8 entries,
7+
1876 wiz_defined-function locations,
8+
530 strings with 4643 characters,
9+
and the built_in function-call counts, 1968 in all, are:
10+
= -- 196
11+
> -- 69
12+
< -- 0
13+
+ -- 26
14+
- -- 18
15+
* -- 136
16+
:= -- 288
17+
add.period$ -- 8
18+
call.type$ -- 8
19+
change.case$ -- 8
20+
chr.to.int$ -- 0
21+
cite$ -- 8
22+
duplicate$ -- 105
23+
empty$ -- 185
24+
format.name$ -- 18
25+
if$ -- 481
26+
int.to.chr$ -- 0
27+
int.to.str$ -- 8
28+
missing$ -- 8
29+
newline$ -- 27
30+
num.names$ -- 8
31+
pop$ -- 20
32+
preamble$ -- 1
33+
purify$ -- 0
34+
quote$ -- 0
35+
skip$ -- 73
36+
stack$ -- 0
37+
substring$ -- 121
38+
swap$ -- 44
39+
text.length$ -- 0
40+
text.prefix$ -- 0
41+
top$ -- 0
42+
type$ -- 0
43+
warning$ -- 0
44+
while$ -- 19
45+
width$ -- 9
46+
write$ -- 76

‎doc/PatternClass.brf‎

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
\backcite {PermGenTPGraph}{{5}{1}{chapter.1}}
2+
\backcite {RegCloSetPerms}{{5}{1}{chapter.1}}
3+
\backcite {RegCloSetPerms}{{5}{1}{chapter.1}}
4+
\backcite {PermGenTPGraph}{{5}{1}{chapter.1}}
5+
\backcite {PermGenTPGraph}{{6}{2}{chapter.2}}
6+
\backcite {RegCloSetPerms}{{10}{3}{chapter.3}}
7+
\backcite {PermGenTPGraph}{{12}{4}{chapter.4}}
8+
\backcite {RegCloSetPerms}{{23}{6}{chapter.6}}
9+
\backcite {FAlgsEnumAllCommIntsof2Perms}{{35}{8.2.1}{subsection.8.2.1}}
10+
\backcite {SimpPermsPoset}{{35}{8.3}{section.8.3}}
11+
\backcite {SimpSurv}{{36}{8.4}{section.8.4}}
12+
\backcite {SimpAndPRestrPerms}{{36}{8.4}{section.8.4}}
13+
\backcite {UpBndStanWilf1324}{{40}{9.1}{section.9.1}}
14+
\backcite {RegLangPlusMinPerms}{{43}{9.3}{section.9.3}}
15+
\backcite {SimpPermsPoset}{{47}{9.5}{section.9.5}}

‎doc/PatternClass.idx‎

Lines changed: 63 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,63 @@
1+
\indexentry{Parstacks@\texttt {Parstacks}|hyperpage}{7}
2+
\indexentry{Seqstacks@\texttt {Seqstacks}|hyperpage}{8}
3+
\indexentry{BufferAndStack@\texttt {BufferAndStack}|hyperpage}{9}
4+
\indexentry{RankEncoding@\texttt {RankEncoding}|hyperpage}{11}
5+
\indexentry{RankDecoding@\texttt {RankDecoding}|hyperpage}{11}
6+
\indexentry{SequencesToRatExp@\texttt {SequencesToRatExp}|hyperpage}{11}
7+
\indexentry{GraphToAut@\texttt {GraphToAut}|hyperpage}{12}
8+
\indexentry{ConstrainedGraphToAut@\texttt {ConstrainedGraphToAut}|hyperpage}{16}
9+
\indexentry{IsStarClosed@\texttt {IsStarClosed}|hyperpage}{20}
10+
\indexentry{Is2StarReplaceable@\texttt {Is2StarReplaceable}|hyperpage}{20}
11+
\indexentry{IsStratified@\texttt {IsStratified}|hyperpage}{21}
12+
\indexentry{IsPossibleGraphAut@\texttt {IsPossibleGraphAut}|hyperpage}{21}
13+
\indexentry{Transducer@\texttt {Transducer}|hyperpage}{23}
14+
\indexentry{DeletionTransducer@\texttt {DeletionTransducer}|hyperpage}{24}
15+
\indexentry{TransposedTransducer@\texttt {TransposedTransducer}|hyperpage}{25}
16+
\indexentry{InvolvementTransducer@\texttt {InvolvementTransducer}|hyperpage}{25}
17+
\indexentry{CombineAutTransducer@\texttt {CombineAutTransducer}|hyperpage}{26}
18+
\indexentry{BasisAutomaton@\texttt {BasisAutomaton}|hyperpage}{27}
19+
\indexentry{ClassAutomaton@\texttt {ClassAutomaton}|hyperpage}{27}
20+
\indexentry{BoundedClassAutomaton@\texttt {BoundedClassAutomaton}|hyperpage}{28}
21+
\indexentry{ClassAutFromBaseEncoding@\texttt {ClassAutFromBaseEncoding}|hyperpage}{28}
22+
\indexentry{ClassAutFromBase@\texttt {ClassAutFromBase}|hyperpage}{29}
23+
\indexentry{ExpandAlphabet@\texttt {ExpandAlphabet}|hyperpage}{29}
24+
\indexentry{ClassDirectSum@\texttt {ClassDirectSum}|hyperpage}{30}
25+
\indexentry{Spectrum@\texttt {Spectrum}|hyperpage}{31}
26+
\indexentry{NumberAcceptedWords@\texttt {NumberAcceptedWords}|hyperpage}{31}
27+
\indexentry{AutStateTransitionMatrix@\texttt {AutStateTransitionMatrix}|hyperpage}{32}
28+
\indexentry{AcceptedWords@\texttt {AcceptedWords}|hyperpage}{32}
29+
\indexentry{AcceptedWordsR@\texttt {AcceptedWordsR}|hyperpage}{32}
30+
\indexentry{AcceptedWordsReversed@\texttt {AcceptedWordsReversed}|hyperpage}{32}
31+
\indexentry{PermComplement@\texttt {PermComplement}|hyperpage}{33}
32+
\indexentry{IsRankEncoding@\texttt {IsRankEncoding}|hyperpage}{33}
33+
\indexentry{IsInterval@\texttt {IsInterval}|hyperpage}{34}
34+
\indexentry{IsSimplePerm@\texttt {IsSimplePerm}|hyperpage}{35}
35+
\indexentry{OnePointDelete@\texttt {OnePointDelete}|hyperpage}{35}
36+
\indexentry{TwoPointDelete@\texttt {TwoPointDelete}|hyperpage}{35}
37+
\indexentry{PointDeletion@\texttt {PointDeletion}|hyperpage}{36}
38+
\indexentry{Inflation@\texttt {Inflation}|hyperpage}{36}
39+
\indexentry{BlockDecomposition@\texttt {BlockDecomposition}|hyperpage}{37}
40+
\indexentry{IsPlusDecomposable@\texttt {IsPlusDecomposable}|hyperpage}{37}
41+
\indexentry{IsMinusDecomposable@\texttt {IsMinusDecomposable}|hyperpage}{38}
42+
\indexentry{PermDirectSum@\texttt {PermDirectSum}|hyperpage}{38}
43+
\indexentry{PermSkewSum@\texttt {PermSkewSum}|hyperpage}{39}
44+
\indexentry{InversionAut@\texttt {InversionAut}|hyperpage}{40}
45+
\indexentry{InversionAutOfClass@\texttt {InversionAutOfClass}|hyperpage}{40}
46+
\indexentry{PlusDecomposableAut@\texttt {PlusDecomposableAut}|hyperpage}{41}
47+
\indexentry{PlusIndecomposableAut@\texttt {PlusIndecomposableAut}|hyperpage}{41}
48+
\indexentry{MinusDecomposableAut@\texttt {MinusDecomposableAut}|hyperpage}{42}
49+
\indexentry{MinusIndecomposableAut@\texttt {MinusIndecomposableAut}|hyperpage}{42}
50+
\indexentry{LengthBoundAut@\texttt {LengthBoundAut}|hyperpage}{43}
51+
\indexentry{ShiftAut@\texttt {ShiftAut}|hyperpage}{43}
52+
\indexentry{NextGap@\texttt {NextGap}|hyperpage}{44}
53+
\indexentry{GapAut@\texttt {GapAut}|hyperpage}{44}
54+
\indexentry{SumAut@\texttt {SumAut}|hyperpage}{45}
55+
\indexentry{GapSumAut@\texttt {GapSumAut}|hyperpage}{45}
56+
\indexentry{NonSimpleAut@\texttt {NonSimpleAut}|hyperpage}{46}
57+
\indexentry{SimplePermAut@\texttt {SimplePermAut}|hyperpage}{46}
58+
\indexentry{IsExceptionalPerm@\texttt {IsExceptionalPerm}|hyperpage}{47}
59+
\indexentry{ExceptionalBoundedAutomaton@\texttt {ExceptionalBoundedAutomaton}|hyperpage}{47}
60+
\indexentry{InbetweenPermAutomaton@\texttt {InbetweenPermAutomaton}|hyperpage}{48}
61+
\indexentry{InbetweenPermSet@\texttt {InbetweenPermSet}|hyperpage}{48}
62+
\indexentry{LoopFreeAut@\texttt {LoopFreeAut}|hyperpage}{49}
63+
\indexentry{LoopVertexFreeAut@\texttt {LoopVertexFreeAut}|hyperpage}{49}

‎doc/PatternClass.ilg‎

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
This is makeindex, version 2.15 [TeX Live 2015] (kpathsea + Thai support).
2+
Scanning input file PatternClass.idx....done (63 entries accepted, 0 rejected).
3+
Sorting entries....done (394 comparisons).
4+
Generating output file PatternClass.ind....done (109 lines written, 0 warnings).
5+
Output written in PatternClass.ind.
6+
Transcript written in PatternClass.ilg.

‎doc/PatternClass.ind‎

Lines changed: 109 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,109 @@
1+
\begin{theindex}
2+
3+
\item \texttt {AcceptedWords}, \hyperpage{32}
4+
\item \texttt {AcceptedWordsR}, \hyperpage{32}
5+
\item \texttt {AcceptedWordsReversed}, \hyperpage{32}
6+
\item \texttt {AutStateTransitionMatrix}, \hyperpage{32}
7+
8+
\indexspace
9+
10+
\item \texttt {BasisAutomaton}, \hyperpage{27}
11+
\item \texttt {BlockDecomposition}, \hyperpage{37}
12+
\item \texttt {BoundedClassAutomaton}, \hyperpage{28}
13+
\item \texttt {BufferAndStack}, \hyperpage{9}
14+
15+
\indexspace
16+
17+
\item \texttt {ClassAutFromBase}, \hyperpage{29}
18+
\item \texttt {ClassAutFromBaseEncoding}, \hyperpage{28}
19+
\item \texttt {ClassAutomaton}, \hyperpage{27}
20+
\item \texttt {ClassDirectSum}, \hyperpage{30}
21+
\item \texttt {CombineAutTransducer}, \hyperpage{26}
22+
\item \texttt {ConstrainedGraphToAut}, \hyperpage{16}
23+
24+
\indexspace
25+
26+
\item \texttt {DeletionTransducer}, \hyperpage{24}
27+
28+
\indexspace
29+
30+
\item \texttt {ExceptionalBoundedAutomaton}, \hyperpage{47}
31+
\item \texttt {ExpandAlphabet}, \hyperpage{29}
32+
33+
\indexspace
34+
35+
\item \texttt {GapAut}, \hyperpage{44}
36+
\item \texttt {GapSumAut}, \hyperpage{45}
37+
\item \texttt {GraphToAut}, \hyperpage{12}
38+
39+
\indexspace
40+
41+
\item \texttt {InbetweenPermAutomaton}, \hyperpage{48}
42+
\item \texttt {InbetweenPermSet}, \hyperpage{48}
43+
\item \texttt {Inflation}, \hyperpage{36}
44+
\item \texttt {InversionAut}, \hyperpage{40}
45+
\item \texttt {InversionAutOfClass}, \hyperpage{40}
46+
\item \texttt {InvolvementTransducer}, \hyperpage{25}
47+
\item \texttt {Is2StarReplaceable}, \hyperpage{20}
48+
\item \texttt {IsExceptionalPerm}, \hyperpage{47}
49+
\item \texttt {IsInterval}, \hyperpage{34}
50+
\item \texttt {IsMinusDecomposable}, \hyperpage{38}
51+
\item \texttt {IsPlusDecomposable}, \hyperpage{37}
52+
\item \texttt {IsPossibleGraphAut}, \hyperpage{21}
53+
\item \texttt {IsRankEncoding}, \hyperpage{33}
54+
\item \texttt {IsSimplePerm}, \hyperpage{35}
55+
\item \texttt {IsStarClosed}, \hyperpage{20}
56+
\item \texttt {IsStratified}, \hyperpage{21}
57+
58+
\indexspace
59+
60+
\item \texttt {LengthBoundAut}, \hyperpage{43}
61+
\item \texttt {LoopFreeAut}, \hyperpage{49}
62+
\item \texttt {LoopVertexFreeAut}, \hyperpage{49}
63+
64+
\indexspace
65+
66+
\item \texttt {MinusDecomposableAut}, \hyperpage{42}
67+
\item \texttt {MinusIndecomposableAut}, \hyperpage{42}
68+
69+
\indexspace
70+
71+
\item \texttt {NextGap}, \hyperpage{44}
72+
\item \texttt {NonSimpleAut}, \hyperpage{46}
73+
\item \texttt {NumberAcceptedWords}, \hyperpage{31}
74+
75+
\indexspace
76+
77+
\item \texttt {OnePointDelete}, \hyperpage{35}
78+
79+
\indexspace
80+
81+
\item \texttt {Parstacks}, \hyperpage{7}
82+
\item \texttt {PermComplement}, \hyperpage{33}
83+
\item \texttt {PermDirectSum}, \hyperpage{38}
84+
\item \texttt {PermSkewSum}, \hyperpage{39}
85+
\item \texttt {PlusDecomposableAut}, \hyperpage{41}
86+
\item \texttt {PlusIndecomposableAut}, \hyperpage{41}
87+
\item \texttt {PointDeletion}, \hyperpage{36}
88+
89+
\indexspace
90+
91+
\item \texttt {RankDecoding}, \hyperpage{11}
92+
\item \texttt {RankEncoding}, \hyperpage{11}
93+
94+
\indexspace
95+
96+
\item \texttt {Seqstacks}, \hyperpage{8}
97+
\item \texttt {SequencesToRatExp}, \hyperpage{11}
98+
\item \texttt {ShiftAut}, \hyperpage{43}
99+
\item \texttt {SimplePermAut}, \hyperpage{46}
100+
\item \texttt {Spectrum}, \hyperpage{31}
101+
\item \texttt {SumAut}, \hyperpage{45}
102+
103+
\indexspace
104+
105+
\item \texttt {Transducer}, \hyperpage{23}
106+
\item \texttt {TransposedTransducer}, \hyperpage{25}
107+
\item \texttt {TwoPointDelete}, \hyperpage{35}
108+
109+
\end{theindex}

0 commit comments

Comments
 (0)