Browse by Author or creator
2020
Cerbai, Giulio and Claesson, Anders and Ferrari, Luca and Steingrímsson, Einar (2020) Sorting with pattern-avoiding stacks : the 132-machine. Electronic Journal of Combinatorics, 27 (3). 3.32. ISSN 1077-8926
2016
Claesson, Anders and Tenner, Bridget Eileen and Ulfarsson, Henning (2016) Coincidence among families of mesh patterns. Preprint / Working Paper. arXiv.org, United States.
2015
Claesson, Anders and Kitaev, Sergey and de Mier, Anna (2015) An involution on bicubic maps and β(0, 1)-trees. Australasian Journal of Combinatorics, 61 (1). pp. 1-18. ISSN 1034-4942
2014
Claesson, Anders and Hannah, Stuart A. (2014) Decomposing labeled interval orders as pairs of permutations. The Electronic Journal of Combinatorics, 21 (4). P4.16. ISSN 1077-8926
Albert, M. H. and Atkinson, M. D. and Claesson, Anders (2014) Isomorphisms between pattern classes. Journal of Combinatorics, 6 (1-2). pp. 3-17. ISSN 2156-3527 (In Press)
2013
Claesson, Anders and Kitaev, Sergey and Steingrimsson, Einar (2013) An involution on beta(1,0)-trees. Advances in Applied Mathematics, 51 (2). pp. 276-284. ISSN 0196-8858
2012
Claesson, Anders and Jelínek, Vít and Steingrimsson, Einar (2012) Upper bounds for the Stanley–Wilf limit of 1324 and other layered patterns. Journal of Combinatorial Theory Series A, 119 (8). pp. 1680-1691. ISSN 0097-3165
Claesson, Anders and Úlfarsson, Henning; (2012) Sorting and preimages of pattern classes. In: 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012). Discrete Mathematics & Theoretical Computer Science, Nancy, France, pp. 595-606.
2011
Claesson, Anders and Dukes, Mark and Kubitzke, Martina (2011) Partition and composition matrices. Journal of Combinatorial Theory Series A, 118 (5). pp. 1624-1637.
Brändén, Petter and Claesson, Anders (2011) Mesh patterns and the expansion of permutation statistics as sums of permutation patterns. The Electronic Journal of Combinatorics, 18 (2). P5.
Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2011) A direct encoding of Stoimenow's matchings as ascent sequences. Australasian Journal of Combinatorics, 49. pp. 47-59.
Albert, Michael and Atkinson, Michael and Bouvel, Mathilde and Claesson, Anders and Dukes, Mark (2011) On the inverse image of pattern classes under bubble sort. Journal of Combinatorics, 2 (2). pp. 231-243. ISSN 2156-3527
Claesson, Anders and Dukes, Mark and Kubitzke, Martina; (2011) Partition and composition matrices : two matrix analogues of set partitions. In: DMTCS Proceedings. Discrete Mathematics & Theoretical Computer Science, Nancy, France, pp. 221-232.
Claesson, A. and Jelinek, V. and Jelinkova, E. and Kitaev, S. (2011) Pattern avoidance in partial permutations. The Electronic Journal of Combinatorics, 18 (1). ISSN 1077-8926
Claesson, Anders and Linusson, Svante (2011) n! matchings, n! posets. Proceedings of the American Mathematical Society, 139 (2). 435–449. ISSN 0002-9939
2010
Bousquet-Melou, Mireille and Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2010) (2+2)-free posets, ascent sequences and pattern avoiding permutations. Journal of Combinatorial Theory Series A, 117 (7). pp. 884-909.
Claesson, Anders and Kitaev, Sergey and Ragnarsson, Kari and Tenner, Bridget Eileen (2010) Boolean complexes for Ferrers graphs. Australasian Journal of Combinatorics, 48. pp. 159-173. ISSN 1034-4942
Chung, Fan and Claesson, Anders and Dukes, Mark and Graham, Ronald (2010) Descent polynomials for permutations with bounded drop size. European Journal of Combinatorics, 31 (7). pp. 1853-1867.
Chung, Fan and Claesson, Anders and Dukes, Mark and Graham, Ronald; (2010) Descent polynomials for permutations with bounded drop size. In: DMTCS Proceedings. Discrete Mathematics & Theoretical Computer Science, Nancy, France, pp. 247-258.
Claesson, Anders and Jelínek, Vit and Jelinkova, Eva and Kitaev, Sergey (2010) Pattern avoidance in partial permutations. In: 22nd International Conference on Formal Power Series & Algebraic Combinatorics, 2010-08-02 - 2010-08-06, San Francisco State University.
Steingrimsson, Einar and Dukes, Mark and Claesson, Anders (2010) Permutations sortable by n-4 passes through a stack. Annals of Combinatorics, 14. pp. 45-51.
2009
Claesson, Anders and Kitaev, Sergey and Steingrimsson, Einar (2009) Decompositions and statistics for β(1,0)-trees and nonseparable permutations. Advances in Applied Mathematics, 42 (3). 313–328. ISSN 0196-8858
Bousquet-Melou, Mireille and Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2009) Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations. In: 21st International Conference on Formal Power Series & Algebraic Combinatorics, 2009-07-20 - 2009-07-24.
2008
Claesson, Anders and Kitaev, Sergey (2008) Classification of bijections between 321- and 132-avoiding permutations. Séminaire Lotharingien de Combinatoire, 60. B60d.
Claesson, Anders and Kitaev, Sergey (2008) Classification of bijections between 321- and 132-avoiding permutations. In: 20th International Conference on Formal Power Series & Algebraic Combinatorics, 2008-06-23 - 2008-06-27.
2007
Claesson, Anders (2007) Conway's napkin problem. American Mathematical Monthly, 114 (3). 217–231. ISSN 0002-9890
2005
Claesson, Anders and Mansour, Toufik (2005) Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns. Ars Combinatoria, 77.
Claesson, Anders (2005) Counting segmented permutations using bicoloured Dyck paths. The Electronic Journal of Combinatorics, 12. R39. ISSN 1077-8926
2003
Claesson, Anders and Godsil, Chris D. and Wagner, David G. (2003) A permutation group determined by an ordered set. Discrete Mathematics, 269 (1-3). 273–279. ISSN 0012-365X
2002
Brändén, Petter and Claesson, Anders and Steingrimsson, Einar (2002) Catalan continued fractions and increasing subsequences in permutations. Discrete Mathematics, 258 (1-3). 275–287. ISSN 0012-365X
Claesson, Anders and Mansour, Toufik (2002) Counting occurrences of a pattern of type (1,2) or (2,1) in permutations. Advances in Applied Mathematics, 29 (2). 293–310. ISSN 0196-8858
2001
Claesson, Anders (2001) Generalized Pattern Avoidance. European Journal of Combinatorics, 22 (7). 961–971. ISSN 0195-6698