Publications (26)
Partition and composition matrices
Anders Claesson, Mark Dukes, Martina Kubitzke
Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns
Anders Claesson, Toufik Mansour
Decompositions and statistics for beta(1,0)-trees and nonseparable permutations
Anders Claesson, Sergey Kitaev, Einar Steingrimsson
Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
Petter Brändén, Anders Claesson
On the inverse image of pattern classes under bubble sort
Michael H. Albert, M. D. Atkinson, Mathilde Bouvel +2
Boolean complexes for Ferrers graphs
Anders Claesson, Sergey Kitaev, Kari Ragnarsson +1
Classification of bijections between 321- and 132-avoiding permutations
Anders Claesson, Sergey Kitaev
Conway's napkin problem
Anders Claesson, T. Kyle Petersen
An involution on β(1,0)-trees
Anders Claesson, Sergey Kitaev, Einar SteingrÃmsson
Generalised Pattern Avoidance
Anders Claesson
n! matchings, n! posets
Anders Claesson, Svante Linusson
Decomposing labeled interval orders as pairs of permutations
Anders Claesson, Stuart A. Hannah
Descent polynomials for permutations with bounded drop size
Fan Chung, Anders Claesson, Mark Dukes +1
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
Anders Claesson, VÃt JelÃnek, Einar SteingrÃmsson
Counting occurrences of a pattern of type (1,2) or (2,1) in permutations
Anders Claesson, Toufik Mansour
Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3
Christian Bean, Anders Claesson, Henning Ulfarsson
An involution on bicubic maps and β(0,1)-trees
Anders Claesson, Sergey Kitaev, Anna de Mier
Coincidence among families of mesh patterns
Anders Claesson, Bridget Eileen Tenner, Henning Ulfarsson
Pattern avoidance in partial permutations
Anders Claesson, Vit Jelinek, Eva Jelinkova +1
Subword counting and the incidence algebra
Anders Claesson
Stack sorting with restricted stacks
Giulio Cerbai, Anders Claesson, Luca Ferrari
A direct encoding of Stoimenow's matchings as ascent sequences
Anders Claesson, Mark Dukes, Sergey Kitaev
Enumerating permutations sortable by $k$ passes through a pop-stack
Anders Claesson, Bjarki Ãgúst Guðmundsson
Permutations sortable by n-4 passes through a stack
Anders Claesson, Mark Dukes, Einar Steingrimsson
Sorting and preimages of pattern classes
Anders Claesson, Henning Ãlfarsson
Isomorphisms between pattern classes
Michael Albert, M. D. Atkinson, Anders Claesson