CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutSign UpSign In

Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.

| Download

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

Views: 418346
Tweet
Share
Share
1
  

2
  

3
  References

4
  

5
  [1]  Albert,  M.  H.  and  Atkinson,  M. D., Simple permutations and pattern

6
  restricted  permutations,  Discrete  Mathematics, 300, 1--3 (2005), 1 -- 15,

7
  (()).

8
  

9
  [2]  Albert,  M. H., Atkinson, M. D. and Ru\v{s}kuc, N., Regular closed sets

10
  of permutations, Theoretical Computer Science, 306 (2003), 85 - 100.

11
  

12
  [3]  Atkinson,  M. D., Livesey, M. J. and Tulley, D., Permutations generated

13
  by  token passing in graphs, Theoretical Computer Science, 178 (n.d.), 103 -

14
  118.

15
  

16
  [4] Brignall, R., A Survey of Simple Permutations, ArXiv e-prints (2008).

17
  

18
  [5]  Claesson,  A.,  Jel{\'{i}}nek,  V.  and  Steingr{\'{i}}msson, E., Upper

19
  bounds  for the Stanley-Wilf limit of 1324 and other layered patterns, ArXiv

20
  e-prints (2011).

21
  

22
  [6]  Hoffmann,  R.  and  Linton,  S.,  Regular Languages of Plus- and Minus-

23
  (In)Decomposable Permutations, Pure Mathematics and Applications (to appear)

24
  (2013).

25
  

26
  [7]  Pierrot,  A.  and Rossin, D., Simple permutations poset, ArXiv e-prints

27
  (2012), 1--15.

28
  

29
  [8]  Uno,  T.  and  Yagiura,  M.,  Fast  Algorithms  to Enumerate All Common

30
  Intervals of Two Permutations, Algorithmica, 26 (2000), 2000.

31
  

32
  

33
  

34
  

35


36