30 citations · 80 across the 23 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 6 cited
Algorithms for discovering and proving theorems about permutation patterns
Hjalti Magnusson, Henning Ulfarsson
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the…
math.CO2012★ 6 cited
Sorting and preimages of pattern classes
Anders Claesson, Henning Úlfarsson
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description o…
math.CO2012★ 1 cited
Restricted non-separable planar maps and some pattern avoiding permutations
Sergey Kitaev, Pavel Salimov, Christopher Severs +1
Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps are in bijection with West-2-stack-sortable permutations…