From 4fbd755c1b42e2d20a67ba5955ea1285a56d0052 Mon Sep 17 00:00:00 2001 From: Chris Jefferson Date: Wed, 28 Aug 2024 10:03:34 +0100 Subject: [PATCH] Update website for PatternClass 2.4.4 --- PackageInfo.g | 4 ++-- README.md | 8 +++++++- _data/package.yml | 8 ++++---- doc/chap0.html | 14 ++++++-------- doc/chap0.txt | 11 ++++------- doc/chap0_mj.html | 16 +++++++--------- doc/chap1.html | 10 +++++----- doc/chap1.txt | 8 ++++---- doc/chap10.html | 4 +++- doc/chap10.txt | 2 ++ doc/chap10_mj.html | 6 ++++-- doc/chap1_mj.html | 12 ++++++------ doc/chap2.html | 4 ++-- doc/chap2.txt | 2 +- doc/chap2_mj.html | 6 +++--- doc/chap3.html | 4 ++-- doc/chap3.txt | 2 +- doc/chap3_mj.html | 6 +++--- doc/chap4.html | 4 ++-- doc/chap4.txt | 4 ++-- doc/chap4_mj.html | 6 +++--- doc/chap5.html | 2 +- doc/chap5_mj.html | 4 ++-- doc/chap6.html | 4 ++-- doc/chap6.txt | 2 +- doc/chap6_mj.html | 6 +++--- doc/chap7.html | 2 +- doc/chap7_mj.html | 4 ++-- doc/chap8.html | 8 ++++---- doc/chap8.txt | 18 +++++++++--------- doc/chap8_mj.html | 10 +++++----- doc/chap9.html | 8 ++++---- doc/chap9.txt | 6 +++--- doc/chap9_mj.html | 10 +++++----- doc/chapBib.html | 18 +++++++++--------- doc/chapBib.txt | 23 ++++++++++++----------- doc/chapBib_mj.html | 20 ++++++++++---------- doc/chapInd.html | 2 +- doc/chapInd_mj.html | 4 ++-- 39 files changed, 149 insertions(+), 143 deletions(-) diff --git a/PackageInfo.g b/PackageInfo.g index 0e64b96..742a7c7 100644 --- a/PackageInfo.g +++ b/PackageInfo.g @@ -10,8 +10,8 @@ SetPackageInfo( rec( PackageName := "PatternClass", Subtitle := "A permutation pattern class package", -Version := "2.4.3", -Date := "17/10/2022", # dd/mm/yyyy format +Version := "2.4.4", +Date := "28/08/2024", # dd/mm/yyyy format License := "GPL-2.0-or-later", Persons := [ diff --git a/README.md b/README.md index 9454e33..3f9e35a 100644 --- a/README.md +++ b/README.md @@ -14,7 +14,7 @@ patched functions are located in lib/automata.* . Introduction ------------ -This is version 2.4.2 of the 'PatternClass' package. +This is version 2.4.4 of the 'PatternClass' package. The 'PatternClass' package allows you to explore the permutation pattern classes build by token passing networks. @@ -89,6 +89,12 @@ online or within GAP help. Changes ------- + + +Changes from 2.4.4 to 2.4.2: +- Update CI, and use latest GAP functionality. +<<<>>><<<>>><<<>>><<<>>> + Changes from 2.4 to 2.4.2: - Changed the name of HashSet due to clash with DataStructure Package - Removed TODOs from code diff --git a/_data/package.yml b/_data/package.yml index 8eea5bb..1538b28 100644 --- a/_data/package.yml +++ b/_data/package.yml @@ -1,6 +1,6 @@ name: PatternClass -version: 2.4.3 -date: 2022-10-17 +version: 2.4.4 +date: 2024-08-28 description: | A permutation pattern class package @@ -24,7 +24,7 @@ needed-pkgs: url: "https://gap-packages.github.io/automata/" - name: "GAPDoc" version: ">= 1.5" - url: "http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc" + url: "https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc" www: https://gap-packages.github.io/PatternClass/ readme: README.md @@ -32,7 +32,7 @@ packageinfo: https://gap-packages.github.io/PatternClass/PackageInfo.g downloads: - name: .tar.gz - url: https://github.com/gap-packages/PatternClass/releases/download/v2.4.3/PatternClass-2.4.3.tar.gz + url: https://github.com/gap-packages/PatternClass/releases/download/v2.4.4/PatternClass-2.4.4.tar.gz abstract: | The PatternClass package is build on the idea of token passing networks building permutation pattern classes. Those classes are best determined by their basis. Both sets can be encoded by rank encoding their permutations. Each, the class and its basis, in their encoded form build a rational language. Rational languages can be easily computed by using automata, which also can be build directly from the token passing networks. Both ways will build the same language, i.e. the same automaton. diff --git a/doc/chap0.html b/doc/chap0.html index e2043ea..ce32311 100644 --- a/doc/chap0.html +++ b/doc/chap0.html @@ -29,10 +29,10 @@

PatternClass

A permutation pattern class package

- 2.3

+ 2.4.4

- 05/07/2017 + 28 August 2024

@@ -45,7 +45,7 @@

A permutation pattern class package


Email: rh347@icloud.com
Homepage: https://rh347.host.cs.st-andrews.ac.uk/ -
Address:
Ruth Hoffmann
School of Computer Science,
University of St. Andrews,
North Haugh,
St. Andrews,
Fife,
KY16 9SS,
SCOTLAND
+
Address:
School of Computer Science,
University of St. Andrews,
North Haugh,
St. Andrews,
Fife,
KY16 9SS,
SCOTLAND

Steve Linton @@ -64,7 +64,7 @@

A permutation pattern class package


Email: malbert@cs.otago.ac.nz -
Homepage: http://www.cs.otago.ac.nz/staff/michael.html +
Homepage: https://www.otago.ac.nz/computer-science/people/Michael_Albert.html
Address:
Michael Albert
Department of Computer Science,
University of Otago,
PO Box 56,
DUNEDIN 9054,
New Zealand,

@@ -252,12 +252,10 @@

Contents


  10.2-2 LoopVertexFreeAut -
Index
References
+
Index

-

 

-
 [Top of Book]  [Contents]   [Next Chapter] 
@@ -265,6 +263,6 @@

Contents

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

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap0.txt b/doc/chap0.txt index 5c18aa2..d757751 100644 --- a/doc/chap0.txt +++ b/doc/chap0.txt @@ -6,10 +6,10 @@  A permutation pattern class package  - 2.3 + 2.4.4 - 05/07/2017 + 28 August 2024 Ruth Hoffmann @@ -23,8 +23,7 @@ Ruth Hoffmann Email: mailto:rh347@icloud.com Homepage: https://rh347.host.cs.st-andrews.ac.uk/ - Address: Ruth Hoffmann - School of Computer Science, + Address: School of Computer Science, University of St. Andrews, North Haugh, St. Andrews, @@ -48,7 +47,7 @@ Michael Albert Email: mailto:malbert@cs.otago.ac.nz - Homepage: http://www.cs.otago.ac.nz/staff/michael.html + Homepage: https://www.otago.ac.nz/computer-science/people/Michael_Albert.html Address: Michael Albert Department of Computer Science, University of Otago, @@ -163,5 +162,3 @@  -   - diff --git a/doc/chap0_mj.html b/doc/chap0_mj.html index ae039d1..eee73e8 100644 --- a/doc/chap0_mj.html +++ b/doc/chap0_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Contents @@ -32,10 +32,10 @@

PatternClass

A permutation pattern class package

- 2.3

+ 2.4.4

- 05/07/2017 + 28 August 2024

@@ -48,7 +48,7 @@

A permutation pattern class package


Email: rh347@icloud.com
Homepage: https://rh347.host.cs.st-andrews.ac.uk/ -
Address:
Ruth Hoffmann
School of Computer Science,
University of St. Andrews,
North Haugh,
St. Andrews,
Fife,
KY16 9SS,
SCOTLAND
+
Address:
School of Computer Science,
University of St. Andrews,
North Haugh,
St. Andrews,
Fife,
KY16 9SS,
SCOTLAND

Steve Linton @@ -67,7 +67,7 @@

A permutation pattern class package


Email: malbert@cs.otago.ac.nz -
Homepage: http://www.cs.otago.ac.nz/staff/michael.html +
Homepage: https://www.otago.ac.nz/computer-science/people/Michael_Albert.html
Address:
Michael Albert
Department of Computer Science,
University of Otago,
PO Box 56,
DUNEDIN 9054,
New Zealand,

@@ -255,12 +255,10 @@

Contents


  10.2-2 LoopVertexFreeAut -
Index
References
+
Index

-

 

-
 [Top of Book]  [Contents]   [Next Chapter] 
@@ -268,6 +266,6 @@

Contents

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

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap1.html b/doc/chap1.html index 5cb686c..284f4bd 100644 --- a/doc/chap1.html +++ b/doc/chap1.html @@ -26,13 +26,13 @@

1 Introduction

-

Token passing networks (TPNs) are directed graphs with nodes that can hold at most one token. Also each graph has a designated input node, which generates an ordered sequence of numbered tokens and a designated output node that collects the tokens in the order they arrive at it. The input node has no incoming edges, whereas the output node has no outgoing edges. A token t travels through the graph, from node to node, if there is an edge connecting the nodes, if the node the token is moving from is either the input node and the tokens 1, ..., t-1 have been released or the node is not the output node, and lastly if the destination node contains no token or it is the output node. [3]

+

Token passing networks (TPNs) are directed graphs with nodes that can hold at most one token. Also each graph has a designated input node, which generates an ordered sequence of numbered tokens and a designated output node that collects the tokens in the order they arrive at it. The input node has no incoming edges, whereas the output node has no outgoing edges. A token t travels through the graph, from node to node, if there is an edge connecting the nodes, if the node the token is moving from is either the input node and the tokens 1, ..., t-1 have been released or the node is not the output node, and lastly if the destination node contains no token or it is the output node. [ALTnd]

-

The set of permutations resulting from a TPN is closed under the property of containment. A permutation a contains a permutation b of shorter length if in a there is a subsequence that is isomorphic to b. This class of permutations can be represented by its anti-chain, which in this context is called the basis. [2]

+

The set of permutations resulting from a TPN is closed under the property of containment. A permutation a contains a permutation b of shorter length if in a there is a subsequence that is isomorphic to b. This class of permutations can be represented by its anti-chain, which in this context is called the basis. [AAR03]

-

To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation p_1 ... p_n, it is the sequence e_1... e_n where e_i is the rank of p_i among {p_i,p_i+1,...,p_n}. It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. Rational languages can be represented by automata. [2]

+

To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation p_1 ... p_n, it is the sequence e_1... e_n where e_i is the rank of p_i among {p_i,p_i+1,...,p_n}. It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. Rational languages can be represented by automata. [AAR03]

-

There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the same rational language as from the process above. [3]

+

There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the same rational language as from the process above. [ALTnd]

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
@@ -41,6 +41,6 @@

1 Introduction

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

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap1.txt b/doc/chap1.txt index a78c85f..31ff583 100644 --- a/doc/chap1.txt +++ b/doc/chap1.txt @@ -10,24 +10,24 @@ connecting the nodes, if the node the token is moving from is either the input node and the tokens 1, ..., t-1 have been released or the node is not the output node, and lastly if the destination node contains no token or it - is the output node. [3] + is the output node. [ALTnd] The set of permutations resulting from a TPN is closed under the property of containment. A permutation a contains a permutation b of shorter length if in a there is a subsequence that is isomorphic to b. This class of permutations can be represented by its anti-chain, which in this context is - called the basis. [2] + called the basis. [AAR03] To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation p_1 ... p_n, it is the sequence e_1... e_n where e_i is the rank of p_i among {p_i,p_i+1,...,p_n}. It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. - Rational languages can be represented by automata. [2] + Rational languages can be represented by automata. [AAR03] There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the - same rational language as from the process above. [3] + same rational language as from the process above. [ALTnd] diff --git a/doc/chap10.html b/doc/chap10.html index e415e9e..456a8f2 100644 --- a/doc/chap10.html +++ b/doc/chap10.html @@ -174,6 +174,8 @@
10.2-2 LoopVertexFreeAut
Accepting state: [ 1 ] gap> +

 

+
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
@@ -181,6 +183,6 @@
10.2-2 LoopVertexFreeAut
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap10.txt b/doc/chap10.txt index 911dd7f..585e0e8 100644 --- a/doc/chap10.txt +++ b/doc/chap10.txt @@ -138,3 +138,5 @@ gap>   +   + diff --git a/doc/chap10_mj.html b/doc/chap10_mj.html index 592878e..8e68a3d 100644 --- a/doc/chap10_mj.html +++ b/doc/chap10_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 10: Miscellaneous functions @@ -177,6 +177,8 @@
10.2-2 LoopVertexFreeAut
Accepting state: [ 1 ] gap> +

 

+
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
@@ -184,6 +186,6 @@
10.2-2 LoopVertexFreeAut
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap1_mj.html b/doc/chap1_mj.html index 0e6f2f6..76e73d0 100644 --- a/doc/chap1_mj.html +++ b/doc/chap1_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 1: Introduction @@ -29,13 +29,13 @@

1 Introduction

-

Token passing networks (TPNs) are directed graphs with nodes that can hold at most one token. Also each graph has a designated input node, which generates an ordered sequence of numbered tokens and a designated output node that collects the tokens in the order they arrive at it. The input node has no incoming edges, whereas the output node has no outgoing edges. A token \(t\) travels through the graph, from node to node, if there is an edge connecting the nodes, if the node the token is moving from is either the input node and the tokens \(1, \ldots, t-1\) have been released or the node is not the output node, and lastly if the destination node contains no token or it is the output node. [3]

+

Token passing networks (TPNs) are directed graphs with nodes that can hold at most one token. Also each graph has a designated input node, which generates an ordered sequence of numbered tokens and a designated output node that collects the tokens in the order they arrive at it. The input node has no incoming edges, whereas the output node has no outgoing edges. A token \(t\) travels through the graph, from node to node, if there is an edge connecting the nodes, if the node the token is moving from is either the input node and the tokens \(1, \ldots, t-1\) have been released or the node is not the output node, and lastly if the destination node contains no token or it is the output node. [ALTnd]

-

The set of permutations resulting from a TPN is closed under the property of containment. A permutation \(a\) contains a permutation \(b\) of shorter length if in \(a\) there is a subsequence that is isomorphic to \(b\). This class of permutations can be represented by its anti-chain, which in this context is called the basis. [2]

+

The set of permutations resulting from a TPN is closed under the property of containment. A permutation \(a\) contains a permutation \(b\) of shorter length if in \(a\) there is a subsequence that is isomorphic to \(b\). This class of permutations can be represented by its anti-chain, which in this context is called the basis. [AAR03]

-

To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation \(p_{1} \ldots p_{n}\), it is the sequence \(e_{1}\ldots e_{n}\) where \(e_{i}\) is the rank of \(p_{i}\) among \(\{p_{i},p_{i+1},\ldots,p_{n}\}\). It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. Rational languages can be represented by automata. [2]

+

To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation \(p_{1} \ldots p_{n}\), it is the sequence \(e_{1}\ldots e_{n}\) where \(e_{i}\) is the rank of \(p_{i}\) among \(\{p_{i},p_{i+1},\ldots,p_{n}\}\). It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. Rational languages can be represented by automata. [AAR03]

-

There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the same rational language as from the process above. [3]

+

There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the same rational language as from the process above. [ALTnd]

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
@@ -44,6 +44,6 @@

1 Introduction

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

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap2.html b/doc/chap2.html index eaceaf9..24b5084 100644 --- a/doc/chap2.html +++ b/doc/chap2.html @@ -35,7 +35,7 @@

2 Token Passing Networks

A token passing network is a directed graph with a designated input node and a designated output node. The input node has no incoming edges whereas the output node has no outgoing edges. Also the input node generates a sequence of tokens, labelled 1, 2, 3, ... . These tokens are passed on to the nodes within the graph, where each node, apart from the input and output node, can hold at most one token at any time. The edges do not hold tokens but are there to pass them on. The following must hold if a token t moves from the node x to the node y.

-

There is an edge from x to y; x is the input node, and the tokens 1, 2, 3, ... , t-1 have been moved, or x is any other node but not the output node; lastly either y is the output node or y is not the input node and currently is not occupied by a token. [3]

+

There is an edge from x to y; x is the input node, and the tokens 1, 2, 3, ... , t-1 have been moved, or x is any other node but not the output node; lastly either y is the output node or y is not the input node and currently is not occupied by a token. [ALTnd]

Token passing networks, or TPNs, are represented in GAP as a list. Each entry of the list is the index of the node within the TPN and contains a list of the "destinations", i.e. the end of the edge or arrow where it is directed to.

@@ -139,6 +139,6 @@
2.1-3 BufferAndStack
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap2.txt b/doc/chap2.txt index 53b633e..188adb1 100644 --- a/doc/chap2.txt +++ b/doc/chap2.txt @@ -13,7 +13,7 @@ There is an edge from x to y; x is the input node, and the tokens 1, 2, 3, ... , t-1 have been moved, or x is any other node but not the output node; lastly either y is the output node or y is not the input node and currently - is not occupied by a token. [3] + is not occupied by a token. [ALTnd] Token passing networks, or TPNs, are represented in GAP as a list. Each entry of the list is the index of the node within the TPN and contains a diff --git a/doc/chap2_mj.html b/doc/chap2_mj.html index 8092c13..c679423 100644 --- a/doc/chap2_mj.html +++ b/doc/chap2_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 2: Token Passing Networks @@ -38,7 +38,7 @@

2 Token Passing Networks

A token passing network is a directed graph with a designated input node and a designated output node. The input node has no incoming edges whereas the output node has no outgoing edges. Also the input node generates a sequence of tokens, labelled 1, 2, 3, ... . These tokens are passed on to the nodes within the graph, where each node, apart from the input and output node, can hold at most one token at any time. The edges do not hold tokens but are there to pass them on. The following must hold if a token \(t\) moves from the node \(x\) to the node \(y\).

-

There is an edge from \(x\) to \(y\); \(x\) is the input node, and the tokens 1, 2, 3, ... , \(t-1\) have been moved, or \(x\) is any other node but not the output node; lastly either \(y\) is the output node or \(y\) is not the input node and currently is not occupied by a token. [3]

+

There is an edge from \(x\) to \(y\); \(x\) is the input node, and the tokens 1, 2, 3, ... , \(t-1\) have been moved, or \(x\) is any other node but not the output node; lastly either \(y\) is the output node or \(y\) is not the input node and currently is not occupied by a token. [ALTnd]

Token passing networks, or TPNs, are represented in GAP as a list. Each entry of the list is the index of the node within the TPN and contains a list of the "destinations", i.e. the end of the edge or arrow where it is directed to.

@@ -142,6 +142,6 @@
2.1-3 BufferAndStack
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap3.html b/doc/chap3.html index b9f593d..5a44eef 100644 --- a/doc/chap3.html +++ b/doc/chap3.html @@ -33,7 +33,7 @@

3 Permutation Encoding

-

A permutation π=π_1 ... π_n has rank encoding p_1 ... p_n where p_i= |{j : j ≥ i, π_j ≤ π_i } |. In other words the rank encoded permutation is a sequence of p_i with 1≤ i≤ n, where p_i is the rank of π_i in {π_i,π_i+1,... ,π_n}. [2]

+

A permutation π=π_1 ... π_n has rank encoding p_1 ... p_n where p_i= |{j : j ≥ i, π_j ≤ π_i } |. In other words the rank encoded permutation is a sequence of p_i with 1≤ i≤ n, where p_i is the rank of π_i in {π_i,π_i+1,... ,π_n}. [AAR03]

The encoding of the permutation 3 2 5 1 6 7 4 8 9 is done as follows:

@@ -220,6 +220,6 @@
3.1-3 SequencesToRatExp
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap3.txt b/doc/chap3.txt index 3b9b7e4..cab29df 100644 --- a/doc/chap3.txt +++ b/doc/chap3.txt @@ -4,7 +4,7 @@ A permutation π=π_1 ... π_n has rank encoding p_1 ... p_n where p_i= |{j : j ≥ i, π_j ≤ π_i } |. In other words the rank encoded permutation is a sequence of p_i with 1≤ i≤ n, where p_i is the rank of π_i in {π_i,π_i+1,... - ,π_n}. [2] + ,π_n}. [AAR03] The encoding of the permutation 3 2 5 1 6 7 4 8 9 is done as follows: diff --git a/doc/chap3_mj.html b/doc/chap3_mj.html index fdeed3b..4347643 100644 --- a/doc/chap3_mj.html +++ b/doc/chap3_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 3: Permutation Encoding @@ -36,7 +36,7 @@

3 Permutation Encoding

-

A permutation \(\pi=\pi_{1} \ldots \pi_{n}\) has rank encoding \(p_{1} \ldots p_{n}\) where \( p_{i}= |\{j : j \geq i, \pi_{j} \leq \pi_{i} \} | \). In other words the rank encoded permutation is a sequence of \(p_{i}\) with \(1\leq i\leq n\), where \(p_{i}\) is the rank of \(\pi_{i}\) in \(\{\pi_{i},\pi_{i+1},\ldots ,\pi_{n}\}\). [2]

+

A permutation \(\pi=\pi_{1} \ldots \pi_{n}\) has rank encoding \(p_{1} \ldots p_{n}\) where \( p_{i}= |\{j : j \geq i, \pi_{j} \leq \pi_{i} \} | \). In other words the rank encoded permutation is a sequence of \(p_{i}\) with \(1\leq i\leq n\), where \(p_{i}\) is the rank of \(\pi_{i}\) in \(\{\pi_{i},\pi_{i+1},\ldots ,\pi_{n}\}\). [AAR03]

The encoding of the permutation 3 2 5 1 6 7 4 8 9 is done as follows:

@@ -223,6 +223,6 @@
3.1-3 SequencesToRatExp
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap4.html b/doc/chap4.html index 8e01be0..7695eb1 100644 --- a/doc/chap4.html +++ b/doc/chap4.html @@ -32,7 +32,7 @@

4 From Networks to Automata

-

It is known that the language of all encoded permutations of a TPN is rational, and thus is it indeed possible to turn a TPN into an automaton. The idea is to inspect all dispositions of tokens within the TPN and find equivalence classes of these dispositions, for more details consult [3]. Adding a constraint, which limits the number of tokens at any time within the TPN, is also considered in this chapter.

+

It is known that the language of all encoded permutations of a TPN is rational, and thus is it indeed possible to turn a TPN into an automaton. The idea is to inspect all dispositions of tokens within the TPN and find equivalence classes of these dispositions, for more details consult [ALTnd]. Adding a constraint, which limits the number of tokens at any time within the TPN, is also considered in this chapter.

The algorithms featured in this chapter do not return the minimal automata representing the input TPN as they are exactly visualising the equivalence classes of the dispositions of the tokens in the TPN. The automaton can be minimalised by choice, as it simplifies future computations involving the automaton also is makes the automata more legible.

@@ -214,6 +214,6 @@
4.1-2 ConstrainedGraphToAut
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap4.txt b/doc/chap4.txt index 4cf18a9..897f0a1 100644 --- a/doc/chap4.txt +++ b/doc/chap4.txt @@ -4,7 +4,7 @@ It is known that the language of all encoded permutations of a TPN is rational, and thus is it indeed possible to turn a TPN into an automaton. The idea is to inspect all dispositions of tokens within the TPN and find - equivalence classes of these dispositions, for more details consult [3]. + equivalence classes of these dispositions, for more details consult [ALTnd]. Adding a constraint, which limits the number of tokens at any time within the TPN, is also considered in this chapter. @@ -101,7 +101,7 @@ gap>   - The input TPN here is the first network described in Chapter 2.. + The input TPN here is the first network described in Chapter 2.0. 4.1-2 ConstrainedGraphToAut diff --git a/doc/chap4_mj.html b/doc/chap4_mj.html index 3a88813..476cf85 100644 --- a/doc/chap4_mj.html +++ b/doc/chap4_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 4: From Networks to Automata @@ -35,7 +35,7 @@

4 From Networks to Automata

-

It is known that the language of all encoded permutations of a TPN is rational, and thus is it indeed possible to turn a TPN into an automaton. The idea is to inspect all dispositions of tokens within the TPN and find equivalence classes of these dispositions, for more details consult [3]. Adding a constraint, which limits the number of tokens at any time within the TPN, is also considered in this chapter.

+

It is known that the language of all encoded permutations of a TPN is rational, and thus is it indeed possible to turn a TPN into an automaton. The idea is to inspect all dispositions of tokens within the TPN and find equivalence classes of these dispositions, for more details consult [ALTnd]. Adding a constraint, which limits the number of tokens at any time within the TPN, is also considered in this chapter.

The algorithms featured in this chapter do not return the minimal automata representing the input TPN as they are exactly visualising the equivalence classes of the dispositions of the tokens in the TPN. The automaton can be minimalised by choice, as it simplifies future computations involving the automaton also is makes the automata more legible.

@@ -217,6 +217,6 @@
4.1-2 ConstrainedGraphToAut
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap5.html b/doc/chap5.html index ca29133..94d56b0 100644 --- a/doc/chap5.html +++ b/doc/chap5.html @@ -149,6 +149,6 @@
5.1-4 IsPossibleGraphAut
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap5_mj.html b/doc/chap5_mj.html index d6778d1..324f7af 100644 --- a/doc/chap5_mj.html +++ b/doc/chap5_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 5: From Automata to Networks @@ -152,6 +152,6 @@
5.1-4 IsPossibleGraphAut
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap6.html b/doc/chap6.html index aacc990..e1d7e87 100644 --- a/doc/chap6.html +++ b/doc/chap6.html @@ -61,7 +61,7 @@

6 Pattern Classes

Permutation pattern classes can be determined using their corresponding basis. The basis of a pattern class is the anti-chain of the class, under the order of containment. A permutation π contains another permutation σ (of shorter length) if there is a subsequence in π, which is isomorphic to σ.

-

With the rational language of the rank encoded class, it is also possible to find the rational language of the basis and vice versa. Several specific kinds of transducers are used in this process. [2]

+

With the rational language of the rank encoded class, it is also possible to find the rational language of the basis and vice versa. Several specific kinds of transducers are used in this process. [AAR03]

@@ -527,6 +527,6 @@
6.4-5 AcceptedWordsR
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap6.txt b/doc/chap6.txt index 8d90e1b..d88c371 100644 --- a/doc/chap6.txt +++ b/doc/chap6.txt @@ -8,7 +8,7 @@ With the rational language of the rank encoded class, it is also possible to find the rational language of the basis and vice versa. Several specific - kinds of transducers are used in this process. [2] + kinds of transducers are used in this process. [AAR03] 6.1 Transducers diff --git a/doc/chap6_mj.html b/doc/chap6_mj.html index addd869..b383de7 100644 --- a/doc/chap6_mj.html +++ b/doc/chap6_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 6: Pattern Classes @@ -64,7 +64,7 @@

6 Pattern Classes

Permutation pattern classes can be determined using their corresponding basis. The basis of a pattern class is the anti-chain of the class, under the order of containment. A permutation \(\pi\) contains another permutation \(\sigma\) (of shorter length) if there is a subsequence in \(\pi\), which is isomorphic to \(\sigma\).

-

With the rational language of the rank encoded class, it is also possible to find the rational language of the basis and vice versa. Several specific kinds of transducers are used in this process. [2]

+

With the rational language of the rank encoded class, it is also possible to find the rational language of the basis and vice versa. Several specific kinds of transducers are used in this process. [AAR03]

@@ -530,6 +530,6 @@
6.4-5 AcceptedWordsR
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap7.html b/doc/chap7.html index b87303a..f48803e 100644 --- a/doc/chap7.html +++ b/doc/chap7.html @@ -89,6 +89,6 @@
7.2-1 IsRankEncoding
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap7_mj.html b/doc/chap7_mj.html index 7af69fa..2a55d8c 100644 --- a/doc/chap7_mj.html +++ b/doc/chap7_mj.html @@ -6,7 +6,7 @@ GAP (PatternClass) - Chapter 7: Some Permutation Essentials @@ -92,6 +92,6 @@
7.2-1 IsRankEncoding
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 Bib Ind
-

generated by GAPDoc2HTML

+

generated by GAPDoc2HTML

diff --git a/doc/chap8.html b/doc/chap8.html index 7fc216a..a90a273 100644 --- a/doc/chap8.html +++ b/doc/chap8.html @@ -107,7 +107,7 @@
8.2-1 IsSimplePerm
‣ IsSimplePerm( perm )( function )

Returns: true if perm is simple.

-

To check whether perm (length of perm = n) is a simple permutation IsSimplePerm uses the basic algorithm proposed by Uno and Yagiura in [8] to compare the perm against the identity permutation of the same length.

+

To check whether perm (length of perm = n) is a simple permutation IsSimplePerm uses the basic algorithm proposed by Uno and Yagiura in [UY00] to compare the perm against the identity permutation of the same length.

 
@@ -123,7 +123,7 @@ 
8.2-1 IsSimplePerm

 
 
8.3  Point Deletion in Simple Permutations 

 
-
In [7] it is shown how one can get chains of permutations by starting with a simple permutation and then removing either a single point or two points and the resulting permutation would still be simple. We have applied this theory to create functions such that the set of simple permutations of shorter length, by one deletion, can be found.

+
In [PR12] it is shown how one can get chains of permutations by starting with a simple permutation and then removing either a single point or two points and the resulting permutation would still be simple. We have applied this theory to create functions such that the set of simple permutations of shorter length, by one deletion, can be found.

 
 

 
@@ -184,7 +184,7 @@ 
8.3-3 PointDeletion

 
 
8.4  Block-Decomposition 

 
-
Given a permutation π of length m and nonempty permutations α_1,...,α_m the inflation of π by α_1,...,α_m, written as π[α_1,...,α_m], is the permutation obtained by replacing each entry π(i) by an interval that is order isomorphic to α_i [4]. Conversely a block-decomposition of σ is any expression of σ as an inflation σ=π[α_1,...,α_m]. The block decomposition of a permutation is unique if and only if σ,π,α_1,...,α_n all are in the same pattern class and π is simple and π≠ 1 2, 2 1 [1].

+
Given a permutation π of length m and nonempty permutations α_1,...,α_m the inflation of π by α_1,...,α_m, written as π[α_1,...,α_m], is the permutation obtained by replacing each entry π(i) by an interval that is order isomorphic to α_i [Bri08]. Conversely a block-decomposition of σ is any expression of σ as an inflation σ=π[α_1,...,α_m]. The block decomposition of a permutation is unique if and only if σ,π,α_1,...,α_n all are in the same pattern class and π is simple and π≠ 1 2, 2 1 [AA05].

 
 
For example the inflation of 25413[21,1,1,1,2413]=3 2 8 9 1 5 7 4 6, written in GAP this is [[2,5,4,1,3],[2,1],[1],[1],[1],[2,4,1,3]]. This decomposition of 3 2 8 9 1 5 7 4 6 is not unique. The unique block-decomposition, as described above, for 3 2 8 9 1 5 7 4 6=2413[21,12,1,2413] or in GAP notation [3,2,8,9,1,5,7,4,6]=[[2,4,1,3],[2,1],[1,2],[1],[2,4,1,3]].

 
@@ -343,6 +343,6 @@ 
8.7-2 PermSkewSum

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chap8.txt b/doc/chap8.txt
index b08df12..9fe5da6 100644
--- a/doc/chap8.txt
+++ b/doc/chap8.txt
@@ -49,8 +49,8 @@
   Returns:  true if perm is simple.
   
   To  check  whether  perm  (length  of  perm  =  n)  is  a simple permutation
-  IsSimplePerm  uses the basic algorithm proposed by Uno and Yagiura in [8] to
-  compare the perm against the identity permutation of the same length.
+  IsSimplePerm  uses the basic algorithm proposed by Uno and Yagiura in [UY00]
+  to compare the perm against the identity permutation of the same length.
   
     Example  
     gap> IsSimplePerm([2,3,4,5,1,1,1,1]);
@@ -65,11 +65,11 @@
   
   8.3 Point Deletion in Simple Permutations
   
-  In [7] it is shown how one can get chains of permutations by starting with a
-  simple permutation and then removing either a single point or two points and
-  the resulting permutation would still be simple. We have applied this theory
-  to  create  functions  such  that  the set of simple permutations of shorter
-  length, by one deletion, can be found.
+  In  [PR12]  it  is  shown how one can get chains of permutations by starting
+  with  a  simple  permutation  and then removing either a single point or two
+  points  and the resulting permutation would still be simple. We have applied
+  this  theory to create functions such that the set of simple permutations of
+  shorter length, by one deletion, can be found.
   
   8.3-1 OnePointDelete
   
@@ -129,10 +129,10 @@
   Given  a permutation π of length m and nonempty permutations α_1,...,α_m the
   inflation of π by α_1,...,α_m, written as π[α_1,...,α_m], is the permutation
   obtained  by  replacing  each  entry  π(i)  by  an  interval  that  is order
-  isomorphic  to  α_i  [4].  Conversely  a  block-decomposition  of  σ  is any
+  isomorphic  to  α_i  [Bri08].  Conversely  a block-decomposition of σ is any
   expression of σ as an inflation σ=π[α_1,...,α_m]. The block decomposition of
   a  permutation  is unique if and only if σ,π,α_1,...,α_n all are in the same
-  pattern class and π is simple and π≠ 1 2, 2 1 [1].
+  pattern class and π is simple and π≠ 1 2, 2 1 [AA05].
   
   For example the inflation of 25413[21,1,1,1,2413]=3 2 8 9 1 5 7 4 6, written
   in GAP this is [[2,5,4,1,3],[2,1],[1],[1],[1],[2,4,1,3]]. This decomposition
diff --git a/doc/chap8_mj.html b/doc/chap8_mj.html
index 4a1aa74..7dc9ada 100644
--- a/doc/chap8_mj.html
+++ b/doc/chap8_mj.html
@@ -6,7 +6,7 @@
 
 
 
 GAP (PatternClass) - Chapter 8: Properties of Permutations 
 
@@ -110,7 +110,7 @@ 
8.2-1 IsSimplePerm

 
‣ IsSimplePerm( perm )( function )

 
Returns: true if perm is simple.

 
-
To check whether perm (length of perm = \(n\)) is a simple permutation IsSimplePerm uses the basic algorithm proposed by Uno and Yagiura in [8] to compare the perm against the identity permutation of the same length.

+
To check whether perm (length of perm = \(n\)) is a simple permutation IsSimplePerm uses the basic algorithm proposed by Uno and Yagiura in [UY00] to compare the perm against the identity permutation of the same length.

 
 
 
 
@@ -126,7 +126,7 @@ 
8.2-1 IsSimplePerm

 
 
8.3  Point Deletion in Simple Permutations 

 
-
In [7] it is shown how one can get chains of permutations by starting with a simple permutation and then removing either a single point or two points and the resulting permutation would still be simple. We have applied this theory to create functions such that the set of simple permutations of shorter length, by one deletion, can be found.

+
In [PR12] it is shown how one can get chains of permutations by starting with a simple permutation and then removing either a single point or two points and the resulting permutation would still be simple. We have applied this theory to create functions such that the set of simple permutations of shorter length, by one deletion, can be found.

 
 

 
@@ -187,7 +187,7 @@ 
8.3-3 PointDeletion

 
 
8.4  Block-Decomposition 

 
-
Given a permutation \(\pi\) of length \(m\) and nonempty permutations \(\alpha_{1},\ldots,\alpha_{m}\) the inflation of \(\pi\) by \(\alpha_{1},\ldots,\alpha_{m}\), written as \(\pi[\alpha_{1},\ldots,\alpha_{m}]\), is the permutation obtained by replacing each entry \(\pi(i)\) by an interval that is order isomorphic to \(\alpha_{i}\) [4]. Conversely a block-decomposition of \(\sigma\) is any expression of \(\sigma\) as an inflation \(\sigma=\pi[\alpha_{1},\ldots,\alpha_{m}]\). The block decomposition of a permutation is unique if and only if \(\sigma,\pi,\alpha_{1},\ldots,\alpha_{n}\) all are in the same pattern class and \(\pi\) is simple and \(\pi\neq 1 2,\ 2 1\) [1].

+
Given a permutation \(\pi\) of length \(m\) and nonempty permutations \(\alpha_{1},\ldots,\alpha_{m}\) the inflation of \(\pi\) by \(\alpha_{1},\ldots,\alpha_{m}\), written as \(\pi[\alpha_{1},\ldots,\alpha_{m}]\), is the permutation obtained by replacing each entry \(\pi(i)\) by an interval that is order isomorphic to \(\alpha_{i}\) [Bri08]. Conversely a block-decomposition of \(\sigma\) is any expression of \(\sigma\) as an inflation \(\sigma=\pi[\alpha_{1},\ldots,\alpha_{m}]\). The block decomposition of a permutation is unique if and only if \(\sigma,\pi,\alpha_{1},\ldots,\alpha_{n}\) all are in the same pattern class and \(\pi\) is simple and \(\pi\neq 1 2,\ 2 1\) [AA05].

 
 
For example the inflation of \(25413[21,1,1,1,2413]=3 2 8 9 1 5 7 4 6\), written in GAP this is [[2,5,4,1,3],[2,1],[1],[1],[1],[2,4,1,3]]. This decomposition of \(3 2 8 9 1 5 7 4 6\) is not unique. The unique block-decomposition, as described above, for \(3 2 8 9 1 5 7 4 6=2413[21,12,1,2413]\) or in GAP notation [3,2,8,9,1,5,7,4,6]=[[2,4,1,3],[2,1],[1,2],[1],[2,4,1,3]].

 
@@ -346,6 +346,6 @@ 
8.7-2 PermSkewSum

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chap9.html b/doc/chap9.html
index 50a36e7..bf5c146 100644
--- a/doc/chap9.html
+++ b/doc/chap9.html
@@ -68,7 +68,7 @@ 
9  Regular Languages of Sets of Permutations 9.1  Inversions in Permutations 

 
-
An inversion in a permutation τ=τ_1...τ_n is a pair (i,j) such that 1≤ i<j≤ n and τ_i>τ_j [5].

+
An inversion in a permutation τ=τ_1...τ_n is a pair (i,j) such that 1≤ i<j≤ n and τ_i>τ_j [CJS11].

 
 

 
@@ -236,7 +236,7 @@ 
9.3  Language of all non-simple permutations E(hatΩ_k) is the sublanguage of E(Ω_k) excluding the words of length ≤ 1.

 
-
E(mathcalD_P(Ω_k)) is the language of all plus-decomposable permutations as described in [6].

+
E(mathcalD_P(Ω_k)) is the language of all plus-decomposable permutations as described in [HL13].

 
 

 
@@ -452,7 +452,7 @@ 
9.5 Exceptionality

 
 
m (2m) (m-1) (2m-1) ... 1 (m+1)

 
-
where m ≥ 2 [7].

+
where m ≥ 2 [PR12].

 
 

 
@@ -503,6 +503,6 @@ 
9.5-2 ExceptionalBoundedAutomaton

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chap9.txt b/doc/chap9.txt
index 7bab3bd..06ece06 100644
--- a/doc/chap9.txt
+++ b/doc/chap9.txt
@@ -8,7 +8,7 @@
   9.1 Inversions in Permutations
   
   An  inversion in a permutation τ=τ_1...τ_n is a pair (i,j) such that 1≤ iτ_j [5].
+  n and τ_i>τ_j [CJS11].
   
   9.1-1 InversionAut
   
@@ -189,7 +189,7 @@
   E(hatΩ_k) is the sublanguage of E(Ω_k) excluding the words of length ≤ 1.
   
   E(mathcalD_P(Ω_k))  is the language of all plus-decomposable permutations as
-  described in [6].
+  described in [HL13].
   
   9.3-1 LengthBoundAut
   
@@ -416,7 +416,7 @@
   
   m (2m) (m-1) (2m-1) ... 1 (m+1)
   
-  where m ≥ 2 [7].
+  where m ≥ 2 [PR12].
   
   9.5-1 IsExceptionalPerm
   
diff --git a/doc/chap9_mj.html b/doc/chap9_mj.html
index 648e006..3db66fe 100644
--- a/doc/chap9_mj.html
+++ b/doc/chap9_mj.html
@@ -6,7 +6,7 @@
 
 
 
 GAP (PatternClass) - Chapter 9:  Regular Languages of Sets of Permutations 
 
@@ -71,7 +71,7 @@ 
9  Regular Languages of Sets of Permutations 9.1  Inversions in Permutations 

 
-
An inversion in a permutation \(\tau=\tau_{1}\ldots\tau_{n}\) is a pair \((i,j)\) such that \(1\leq i<j\leq n\) and \(\tau_{i}>\tau_{j}\) [5].

+
An inversion in a permutation \(\tau=\tau_{1}\ldots\tau_{n}\) is a pair \((i,j)\) such that \(1\leq i<j\leq n\) and \(\tau_{i}>\tau_{j}\) [CJS11].

 
 

 
@@ -250,7 +250,7 @@ 
9.3  Language of all non-simple permutations \(E(\hat{\Omega}_{k})\) is the sublanguage of \(E(\Omega_{k})\) excluding the words of length \(\leq 1\).

 
-
\(E(\mathcal{D}_{P}(\Omega_{k}))\) is the language of all plus-decomposable permutations as described in [6].

+
\(E(\mathcal{D}_{P}(\Omega_{k}))\) is the language of all plus-decomposable permutations as described in [HL13].

 
 

 
@@ -476,7 +476,7 @@ 
9.5 Exceptionality

 m (2m) (m-1) (2m-1) \ldots 1 (m+1)
 \]

 
-
where \(m \geq 2\) [7].

+
where \(m \geq 2\) [PR12].

 
 

 
@@ -527,6 +527,6 @@ 
9.5-2 ExceptionalBoundedAutomaton

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chapBib.html b/doc/chapBib.html
index e5eeaaa..41a79a1 100644
--- a/doc/chapBib.html
+++ b/doc/chapBib.html
@@ -27,7 +27,7 @@ 
References

 
 

 

-[1]   Albert, M. H. and Atkinson, M. D.,
+[AA05]   Albert, M. H. and Atkinson, M. D.,
 Simple permutations and pattern restricted permutations,
  Discrete Mathematics,
  300 (1--3)
@@ -39,7 +39,7 @@ 
References

 
 

 

-[2]   Albert, M. H., Atkinson, M. D. and Ru\v{s}kuc, N.,
+[AAR03]   Albert, M. H., Atkinson, M. D. and Ru\v{s}kuc, N.,
 Regular closed sets of permutations,
  Theoretical Computer Science,
  306
@@ -50,7 +50,7 @@ 
References

 
 

 

-[3]   Atkinson, M. D., Livesey, M. J. and Tulley, D.,
+[ALTnd]   Atkinson, M. D., Livesey, M. J. and Tulley, D.,
 Permutations generated by token passing in graphs,
  Theoretical Computer Science,
  178
@@ -61,7 +61,7 @@ 
References

 
 

 

-[4]   Brignall, R.,
+[Bri08]   Brignall, R.,
  A Survey of Simple Permutations,
  ArXiv e-prints
  (2008).
@@ -70,7 +70,7 @@ 
References

 
 

 

-[5]   Claesson, A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E.,
+[CJS11]   Claesson, A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E.,
  Upper bounds for the Stanley-Wilf limit of 1324 and other layered
       patterns,
  ArXiv e-prints
@@ -80,7 +80,7 @@ 
References

 
 

 

-[6]   Hoffmann, R. and Linton, S.,
+[HL13]   Hoffmann, R. and Linton, S.,
  Regular Languages of Plus- and Minus- (In)Decomposable
       Permutations,
  Pure Mathematics and Applications (to appear)
@@ -90,7 +90,7 @@ 
References

 
 

 

-[7]   Pierrot, A. and Rossin, D.,
+[PR12]   Pierrot, A. and Rossin, D.,
  Simple permutations poset,
  ArXiv e-prints
  (2012),
@@ -100,7 +100,7 @@ 
References

 
 

 

-[8]   Uno, T. and Yagiura, M.,
+[UY00]   Uno, T. and Yagiura, M.,
  Fast Algorithms to Enumerate All Common Intervals of Two
       Permutations,
  Algorithmica,
@@ -118,6 +118,6 @@ 
References

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chapBib.txt b/doc/chapBib.txt
index a103001..b444212 100644
--- a/doc/chapBib.txt
+++ b/doc/chapBib.txt
@@ -2,31 +2,32 @@
   
   References
   
-  [1]  Albert,  M.  H.  and  Atkinson,  M. D., Simple permutations and pattern
+  [AA05]  Albert,  M.  H. and Atkinson, M. D., Simple permutations and pattern
   restricted  permutations,  Discrete  Mathematics, 300, 1--3 (2005), 1 -- 15,
   ().
   
-  [2]  Albert,  M. H., Atkinson, M. D. and Ru\v{s}kuc, N., Regular closed sets
-  of permutations, Theoretical Computer Science, 306 (2003), 85 - 100.
+  [AAR03]  Albert,  M.  H., Atkinson, M. D. and Ru\v{s}kuc, N., Regular closed
+  sets of permutations, Theoretical Computer Science, 306 (2003), 85 - 100.
   
-  [3]  Atkinson,  M. D., Livesey, M. J. and Tulley, D., Permutations generated
-  by  token passing in graphs, Theoretical Computer Science, 178 (n.d.), 103 -
-  118.
+  [ALTnd]  Atkinson,  M.  D.,  Livesey,  M.  J.  and  Tulley, D., Permutations
+  generated  by  token  passing  in  graphs, Theoretical Computer Science, 178
+  (n.d.), 103 - 118.
   
-  [4] Brignall, R., A Survey of Simple Permutations, ArXiv e-prints (2008).
+  [Bri08]  Brignall,  R.,  A  Survey  of  Simple  Permutations, ArXiv e-prints
+  (2008).
   
-  [5]  Claesson,  A.,  Jel{\'{i}}nek,  V.  and  Steingr{\'{i}}msson, E., Upper
+  [CJS11]  Claesson,  A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E., Upper
   bounds  for the Stanley-Wilf limit of 1324 and other layered patterns, ArXiv
   e-prints (2011).
   
-  [6]  Hoffmann,  R.  and  Linton,  S.,  Regular Languages of Plus- and Minus-
+  [HL13]  Hoffmann,  R.  and Linton, S., Regular Languages of Plus- and Minus-
   (In)Decomposable Permutations, Pure Mathematics and Applications (to appear)
   (2013).
   
-  [7]  Pierrot,  A.  and Rossin, D., Simple permutations poset, ArXiv e-prints
+  [PR12] Pierrot, A. and Rossin, D., Simple permutations poset, ArXiv e-prints
   (2012), 1--15.
   
-  [8]  Uno,  T.  and  Yagiura,  M.,  Fast  Algorithms  to Enumerate All Common
+  [UY00]  Uno,  T.  and  Yagiura,  M., Fast Algorithms to Enumerate All Common
   Intervals of Two Permutations, Algorithmica, 26 (2000), 2000.
   
   
diff --git a/doc/chapBib_mj.html b/doc/chapBib_mj.html
index fdede89..16e0c4d 100644
--- a/doc/chapBib_mj.html
+++ b/doc/chapBib_mj.html
@@ -6,7 +6,7 @@
 
 
 
 GAP (PatternClass) - References
 
@@ -30,7 +30,7 @@ 
References

 
 

 

-[1]   Albert, M. H. and Atkinson, M. D.,
+[AA05]   Albert, M. H. and Atkinson, M. D.,
 Simple permutations and pattern restricted permutations,
  Discrete Mathematics,
  300 (1--3)
@@ -42,7 +42,7 @@ 
References

 
 

 

-[2]   Albert, M. H., Atkinson, M. D. and Ru\v{s}kuc, N.,
+[AAR03]   Albert, M. H., Atkinson, M. D. and Ru\v{s}kuc, N.,
 Regular closed sets of permutations,
  Theoretical Computer Science,
  306
@@ -53,7 +53,7 @@ 
References

 
 

 

-[3]   Atkinson, M. D., Livesey, M. J. and Tulley, D.,
+[ALTnd]   Atkinson, M. D., Livesey, M. J. and Tulley, D.,
 Permutations generated by token passing in graphs,
  Theoretical Computer Science,
  178
@@ -64,7 +64,7 @@ 
References

 
 

 

-[4]   Brignall, R.,
+[Bri08]   Brignall, R.,
  A Survey of Simple Permutations,
  ArXiv e-prints
  (2008).
@@ -73,7 +73,7 @@ 
References

 
 

 

-[5]   Claesson, A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E.,
+[CJS11]   Claesson, A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E.,
  Upper bounds for the Stanley-Wilf limit of 1324 and other layered
       patterns,
  ArXiv e-prints
@@ -83,7 +83,7 @@ 
References

 
 

 

-[6]   Hoffmann, R. and Linton, S.,
+[HL13]   Hoffmann, R. and Linton, S.,
  Regular Languages of Plus- and Minus- (In)Decomposable
       Permutations,
  Pure Mathematics and Applications (to appear)
@@ -93,7 +93,7 @@ 
References

 
 

 

-[7]   Pierrot, A. and Rossin, D.,
+[PR12]   Pierrot, A. and Rossin, D.,
  Simple permutations poset,
  ArXiv e-prints
  (2012),
@@ -103,7 +103,7 @@ 
References

 
 

 

-[8]   Uno, T. and Yagiura, M.,
+[UY00]   Uno, T. and Yagiura, M.,
  Fast Algorithms to Enumerate All Common Intervals of Two
       Permutations,
  Algorithmica,
@@ -121,6 +121,6 @@ 
References

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chapInd.html b/doc/chapInd.html
index abd449f..df956d4 100644
--- a/doc/chapInd.html
+++ b/doc/chapInd.html
@@ -98,6 +98,6 @@ 
Index

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML

 
 
diff --git a/doc/chapInd_mj.html b/doc/chapInd_mj.html
index ee62a68..94aa86b 100644
--- a/doc/chapInd_mj.html
+++ b/doc/chapInd_mj.html
@@ -6,7 +6,7 @@
 
 
 
 GAP (PatternClass) - Index
 
@@ -101,6 +101,6 @@ 
Index

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

 
 

-
generated by GAPDoc2HTML

+
generated by GAPDoc2HTML