  
  [1X10 [33X[0;0YMiscellaneous functions[133X[101X
  
  [33X[0;0YThis  temporary  chapter  is  dedicated  to miscellaneous functions that are
  relevant to some specific ongoing research questions.[133X
  
  
  [1X10.1 [33X[0;0YPermutation Inclusion Set[133X[101X
  
  [33X[0;0YThis section is dedicated to the search of the set of permutations which lay
  in between two permutations. Formally that is [22XI_π,ρ = {ρ : π ≤ ρ σ}[122X.[133X
  
  [1X10.1-1 InbetweenPermAutomaton[101X
  
  [33X[1;0Y[29X[2XInbetweenPermAutomaton[102X( [3Xperm1[103X, [3Xperm2[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10YAn  automaton which accepts the encoded permutations between [10Xperm1[110X
            and [10Xperm2[110X where, [10Xperm2[110X is the subpermutation.[133X
  
  [33X[0;0Y[10XInbetweenPermAutomaton[110X   creates   the  intersection  language  between  the
  language   of   all   subpermutations   of   [10Xperm1[110X   and   the  language  of
  superpermutations of [10Xperm2[110X.[133X
  
  [4X[32X  Example  [32X[104X
    [4X[28X	gap> InbetweenPermAutomaton([3,2,1,4,6,5],[1,2]);[128X[104X
    [4X[28X	< deterministic automaton on 3 letters with 8 states >[128X[104X
    [4X[28X	gap> Display(last);[128X[104X
    [4X[28X	   |  1  2  3  4  5  6  7  8[128X[104X
    [4X[28X	-----------------------------[128X[104X
    [4X[28X	 a |  2  2  1  1  6  3  2  6[128X[104X
    [4X[28X	 b |  2  2  4  2  2  4  5  5[128X[104X
    [4X[28X	 c |  2  2  2  2  2  2  2  7[128X[104X
    [4X[28X	Initial state:    [ 8 ][128X[104X
    [4X[28X	Accepting states: [ 1, 3 ][128X[104X
    [4X[28X	gap>  [128X[104X
  [4X[32X[104X
  
  [1X10.1-2 InbetweenPermSet[101X
  
  [33X[1;0Y[29X[2XInbetweenPermSet[102X( [3Xperm1[103X, [3Xperm2[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10YA  list  which  contains  the permutations between [10Xperm1[110X and [10Xperm2[110X
            where, [10Xperm2[110X is the subpermutation.[133X
  
  [33X[0;0YUsing  [10XInbetweenPermAutomaton[110X  we  create the set of all permutations laying
  between the input permutations.[133X
  
  [4X[32X  Example  [32X[104X
    [4X[25Xgap>[125X [27XInbetweenPermSet([3,2,1,4,6,5],[1,2]);[127X[104X
    [4X[28X[ [ 1, 2 ], [ 1, 2, 3 ], [ 1, 3, 2 ], [ 2, 1, 3 ], [ 1, 2, 4, 3 ],[128X[104X
    [4X[28X  [ 2, 1, 3, 4 ], [ 2, 1, 4, 3 ], [ 3, 2, 1, 4 ], [ 2, 1, 3, 5, 4 ],[128X[104X
    [4X[28X  [ 3, 2, 1, 4, 5 ], [ 3, 2, 1, 5, 4 ], [ 3, 2, 1, 4, 6, 5 ] ][128X[104X
    [4X[25Xgap>[125X [27X[127X[104X
  [4X[32X[104X
  
  [1X10.1-3 IsSubPerm[101X
  
  [33X[1;0Y[29X[2XIsSubPerm[102X( [3Xperm1[103X, [3Xperm2[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10Y[10Xtrue[110X if [10Xperm2[110X is a subpermutation of [10Xperm1[110X.[133X
  
  [33X[0;0YCreates  the  automaton  accepting  all subpermutations of [10Xperm1[110X of the same
  rank  or less, and checks whether the automaton accepts the rank encoding of
  [10Xperm2[110X.[133X
  
  [4X[32X  Example  [32X[104X
    [4X[25Xgap>[125X [27XIsSubPerm([2,4,6,8,1,3,5,7],[2,3,1]);[127X[104X
    [4X[28Xtrue[128X[104X
    [4X[25Xgap>[125X [27XIsSubPerm([2,4,6,8,1,3,5,7],[3,2,1]);[127X[104X
    [4X[28Xfalse[128X[104X
    [4X[25Xgap>[125X [27X[127X[104X
  [4X[32X[104X
  
  
  [1X10.2 [33X[0;0YAutomaton Manipulation[133X[101X
  
  [1X10.2-1 LoopFreeAut[101X
  
  [33X[1;0Y[29X[2XLoopFreeAut[102X( [3Xaut[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10YAn automaton without any loops of length 1.[133X
  
  [33X[0;0Y[10XLoopFreeAut[110X  builds  the subautomaton of [10Xaut[110X that does not contain any loops
  of length 1, except for the sink state.[133X
  
  [4X[32X  Example  [32X[104X
    [4X[25Xgap>[125X [27Xa:=Automaton("det",4,3,[[2,4,3,3],[4,4,1,4],[3,1,2,4]],[1],[2]);[127X[104X
    [4X[28X< deterministic automaton on 3 letters with 4 states >[128X[104X
    [4X[25Xgap>[125X [27XDisplay(a);[127X[104X
    [4X[28X   |  1  2  3  4[128X[104X
    [4X[28X-----------------[128X[104X
    [4X[28X a |  2  4  3  3[128X[104X
    [4X[28X b |  4  4  1  4[128X[104X
    [4X[28X c |  3  1  2  4[128X[104X
    [4X[28XInitial state:   [ 1 ][128X[104X
    [4X[28XAccepting state: [ 2 ][128X[104X
    [4X[25Xgap>[125X [27Xb:=LoopFreeAut(a);[127X[104X
    [4X[28X< deterministic automaton on 3 letters with 5 states >[128X[104X
    [4X[25Xgap>[125X [27XDisplay(b);[127X[104X
    [4X[28X   |  1  2  3  4  5[128X[104X
    [4X[28X--------------------[128X[104X
    [4X[28X a |  2  4  5  3  5[128X[104X
    [4X[28X b |  4  4  1  5  5[128X[104X
    [4X[28X c |  3  1  2  5  5[128X[104X
    [4X[28XInitial state:   [ 1 ][128X[104X
    [4X[28XAccepting state: [ 2 ][128X[104X
    [4X[25Xgap>[125X [27X[127X[104X
  [4X[32X[104X
  
  [1X10.2-2 LoopVertexFreeAut[101X
  
  [33X[1;0Y[29X[2XLoopVertexFreeAut[102X( [3Xaut[103X ) [32X function[133X
  [6XReturns:[106X  [33X[0;10YAn automaton without any vertices that had loops of length 1.[133X
  
  [33X[0;0Y[10XLoopVertexFreeAut[110X builds the subautomaton that does not contain the vertices
  and transitions of vertices in [10Xaut[110X that have loops of length 1. The function
  minimalises  and determinises the automaton before returning it, which might
  change  the  numbering  on  the  vertices,  but  the  returned  automaton is
  isomorphic to the subautomaton of [10Xaut[110X.[133X
  
  [4X[32X  Example  [32X[104X
    [4X[25Xgap>[125X [27Xa:=Automaton("det",4,3,[[2,4,3,3],[4,4,1,4],[3,1,2,4]],[1],[2]);[127X[104X
    [4X[28X< deterministic automaton on 3 letters with 4 states >[128X[104X
    [4X[25Xgap>[125X [27XDisplay(a);[127X[104X
    [4X[28X   |  1  2  3  4[128X[104X
    [4X[28X-----------------[128X[104X
    [4X[28X a |  2  4  3  3[128X[104X
    [4X[28X b |  4  4  1  4[128X[104X
    [4X[28X c |  3  1  2  4[128X[104X
    [4X[28XInitial state:   [ 1 ][128X[104X
    [4X[28XAccepting state: [ 2 ][128X[104X
    [4X[25Xgap>[125X [27Xb:=LoopVertexFreeAut(a);[127X[104X
    [4X[28X< deterministic automaton on 3 letters with 3 states >[128X[104X
    [4X[25Xgap>[125X [27XDisplay(b);[127X[104X
    [4X[28X   |  1  2  3[128X[104X
    [4X[28X--------------[128X[104X
    [4X[28X a |  2  2  1[128X[104X
    [4X[28X b |  2  2  2[128X[104X
    [4X[28X c |  3  2  2[128X[104X
    [4X[28XInitial state:   [ 3 ][128X[104X
    [4X[28XAccepting state: [ 1 ][128X[104X
    [4X[25Xgap>[125X [27X[127X[104X
  [4X[32X[104X
  
