Latest Posts

• Notable successes for TileScope (aka PermScope) as of June 2019

  17 Jun 2019

  Tilescope is an algorithm for finding and proving structures of permutation classes. When it succeeds it returns a combinatorial specification for the class. In many cases the specification only uses Cartesian products and disjoint unions, and this allows us to turn the specification into a system of equations with a single variable. Some notable examples include:

• Macros for drawing permutation patterns

  20 Aug 2018

  This is a test post. I will update it with information about how to use macros to save time when you need to draw permutation patterns

• PhD fellowships in Algorithms for Permutation Structures

  01 Jan 2014

  Applications are invited for Ph.D. positions at the School of Computer Science (SCS), Reykjavik University (RU), funded by a project grant from the Icelandic Research Fund, under the direction of Michael Albert (University of Otago), Anders Claesson (University of Strathclyde) and Henning Ulfarsson (Principal investigator, Reykjavik University). The application deadline is March 31, 2014.