50 citations · 148 across the 32 of their papers we have counts for
38 papers
Involution on Catalan structures
Anders Claesson, Sergey Kitaev, Einar Steingrímsson +1
We define an involution on Catalan structures through an abstract framework, prove an equidistribution theorem for four canonical statistics and present a generating function c…
Restricted Permutations Enumerated by Inversions
Atli Fannar Franklín, Anders Claesson, Christian Bean +2
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposab…
Permutations with few inversions
Anders Claesson, Atli Fannar Franklín, Einar Steingrímsson
A curious generating function for permutations of with exactly inversions is presented. Moreover, is shown to be the generating function for pe…
Turning cycle restrictions into mesh patterns via Foata's fundamental transformation
Anders Claesson, Henning Ulfarsson
An adjacent -cycle is a natural generalization of an adjacent transposition. We show that the number of adjacent -cycles in a permutation maps to the sum of occurrences of tw…
Fishburn trees
Giulio Cerbai, Anders Claesson
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the verte…
Counting tournament score sequences
Anders Claesson, Mark Dukes, Atli Fannar Franklín +1
The score sequence of a tournament is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The problem of counting score sequences of a tournament with…