!!!!!!!!!!!!!! ! Patch info ! !!!!!!!!!!!!!! We had to patch the IntersectionAutomaton, UnionAutomata and ProductLanguage from the Automata pkg (version 1.13) to improve performance testing. The patched functions are located in lib/automata.* .
This is version 2.4.2 of the ‘PatternClass’ package.
The ‘PatternClass’ package allows you to explore the permutation pattern classes build by token passing networks. Amongst other things, ‘PatternClass’ can compute the basis of a permutation pattern class et vice versa, rank encode and decode permutations, create automata from token passing networks and checking if the deterministic automaton is a possible representative of a token passing network. More details on what functions “PatternClass’ contains, consult the manual in the doc folder.
If there are any problems with the package please do not hesitate to contact us.
This package comes with the following files and directories
doc the directory with the manual init.g this file does initialise the package lib this directory contains all GAP code lib/grid this directory contains experimental code which is not preloaded see README in lib/grid for info PackageInfo.g the information file for automatic processing read.g this file reads the package README you are currently reading this file
If you get ‘PatternClass’ as a compressed file unpack it in the pkg/ folder in the gap4r4 folder where GAP is installed on your computer. To uncompress the .tar.gz file on UNIX use the following command
tar xzf PatternClass2.4.2.tar.gz
If your version of tar does not support the z option use
gunzip PatternClass2.4.2.tar.gz tar xf PatternClass2.4.2.tar
This will create the folder PatternClass in pkg/ and within that you will find the directories and files mentioned above.
To use the package within GAP, run GAP and type the following
Loading Automata 1.13 For help, type: ?Automata: —————————————————————- ───────────────────────────────────────────────────────────────────────────── Loading PatternClass 2.4.2 (A permutation pattern class package) by Ruth Hoffmann (https://rh347.host.cs.st-andrews.ac.uk/), Steve Linton (http://sal.host.cs.st-andrews.ac.uk/), and Michael Albert (http://www.cs.otago.ac.nz/staff/michael.html). Homepage: https://gap-packages.github.io/PatternClass/ ───────────────────────────────────────────────────────────────────────────── true gap>
Now you can use all functions of ‘PatternClass’ within this session of GAP. As described in the manual, found in the doc directory or online or within GAP help.
Changes from 2.4 to 2.4.2:
Changes from 2.3 to 2.4:
Changes from 2.2 to 2.3:
Changes from 2.1 to 2.2:
Changes from 2.0 to 2.1:
Changes from 1.12358132134 to 2.0:
Changes from 1.123581321 to 1.1235813213455:
Changes from 1.1235813 to 1.123581321:
Changes from 1.12358 to 1.1235813:
Changes from 1.1235 to 1.12358:
Changes from 1.123 to 1.1235:
Changes from 1.12 to 1.123:
Changes from 1.1 to 1.12:
Changes from 1.0 to 1.1:
Improvement in BoundedClassAutomaton
Functions to build the rational subsets of a class accepting all plus- (minus-) decomposable permutations (also indecomposable permutations)
A function calculating the complement of a permutation
Functions to calculate the direct sum or the skew sum of 2 permutations
A function calculating the direct sum for 2 rational pattern classes
A function to build the automaton that accepts all permutations under the rank encoding that have the same number of inversions.