Anders Claesson

Professor at the University of Iceland
akc[at]hi.is · ORCID · Google Scholar

Papers

  1. Hertzsprung patterns in Cayley permutations
    Giulio Cerbai, Anders Claesson
    Preprint, 2026
    BibTeX · Timestamp
  2. Finiteness theorems for Cayley permutation classes
    Giulio Cerbai, Anders Claesson
    Preprint, 2026
    BibTeX · Timestamp
  3. Simple Cayley permutations
    Giulio Cerbai, Anders Claesson
    Preprint, 2026
    BibTeX · Timestamp
  4. The species of interval orders
    Anders Claesson
    Preprint, 2026
    BibTeX · Timestamp
  5. Involution h on Catalan structures
    Anders Claesson, Sergey Kitaev, Einar Steingrímsson, Lintong Wang
    Preprint, 2026
    BibTeX · Timestamp
  6. Inversion monotonicity in subclasses of the 1324-avoiders
    Anders Claesson, Svante Linusson, Henning Úlfarsson, Emil Verkama
    Preprint, 2026
    BibTeX · Timestamp
  7. Counting fixed-point-free Cayley permutations
    Giulio Cerbai, Anders Claesson
    Proceedings of the Edinburgh Mathematical Society, 2026
    Journal version · BibTeX · Timestamp
  8. Enumerative aspects of Caylerian polynomials
    Giulio Cerbai, Anders Claesson
    Preprint, 2024
    Accepted for publication in Journal of Combinatorics
    BibTeX · Timestamp
  9. Self-modified difference ascent sequences
    Giulio Cerbai, Anders Claesson, Bruce Sagan
    Advances in Applied Mathematics, 2025
    Journal version · BibTeX · Timestamp
  10. Pattern-avoiding Cayley permutations via combinatorial species
    Giulio Cerbai, Anders Claesson, Dana C. Ernst, Hannah Golab
    Australasian Journal of Combinatorics, 2026
    Journal version · BibTeX · Timestamp
  11. Modified difference ascent sequences and Fishburn structures
    Giulio Cerbai, Anders Claesson, Bruce Sagan
    Discrete Mathematics, 2026
    Journal version · BibTeX · Timestamp
  12. Caylerian polynomials
    Giulio Cerbai, Anders Claesson
    Discrete Mathematics, 2024
    Journal version · BibTeX · Timestamp
  13. Permutations with few inversions
    Anders Claesson, Atli Fannar Franklín, Einar Steingrímsson
    The Electronic Journal of Combinatorics, 2023
    Journal version · BibTeX
  14. Turning cycle restrictions into mesh patterns via Foata’s fundamental transformation
    Anders Claesson, Henning Úlfarsson
    Discrete Mathematics, 2024
    Journal version · BibTeX · Timestamp
  15. Fishburn trees
    Giulio Cerbai, Anders Claesson
    Advances in Applied Mathematics, 2023
    Journal version · BibTeX · Timestamp
  16. Counting tournament score sequences
    Anders Claesson, Mark Dukes, Atli Fannar Franklín, Sigurður Örn Stefánsson
    Proceedings of the American Mathematical Society, 2023
    Extended abstract appeared at EUROCOMB’23
    Journal version · BibTeX · Timestamp
  17. Combinatorial Exploration: An Algorithmic Framework for Enumeration
    Michael Albert, Christian Bean, Anders Claesson, Émile Nadeau, Jay Pantone, Henning Úlfarsson
    Memoirs of the American Mathematical Society, 2026
    Journal version · BibTeX · Timestamp
  18. Weak ascent sequences and related combinatorial structures
    Beáta Bényi, Anders Claesson, Mark Dukes
    European Journal of Combinatorics, 2023
    Journal version · BibTeX · Timestamp
  19. From Hertzsprung’s problem to pattern-rewriting systems
    Anders Claesson
    Algebraic Combinatorics, 2022
    Journal version · BibTeX
  20. Sorting with pattern-avoiding stacks: the 132-machine
    Giulio Cerbai, Anders Claesson, Luca Ferrari, Einar Steingrímsson
    The Electronic Journal of Combinatorics, 2020
    Journal version · BibTeX · Timestamp
  21. Transport of patterns by Burge transpose
    Giulio Cerbai, Anders Claesson
    European Journal of Combinatorics, 2023
    Journal version · BibTeX · Timestamp
  22. Counting pop-stacked permutations in polynomial time
    Anders Claesson, Bjarki Ágúst Guðmundsson, Jay Pantone
    Experimental Mathematics, 2023
    Journal version · BibTeX · Associated repo · Timestamp
  23. Stack sorting with restricted stacks
    Giulio Cerbai, Anders Claesson, Luca Ferrari
    Journal of Combinatorial Theory, Series A, 2020
    Journal version · BibTeX
  24. Enumerating permutations sortable by k passes through a pop-stack
    Anders Claesson, Bjarki Ágúst Guðmundsson
    Advances in Applied Mathematics, 2019
    Extended abstract appeared at FPSAC 2018
    Journal version · BibTeX · Associated repo
  25. A species approach to Rota’s twelvefold way
    Anders Claesson
    Expositiones Mathematicae, 2019
    Journal version · BibTeX
  26. Surveys in Combinatorics 2017
    Anders Claesson, Mark Dukes, Sergey Kitaev, David Manlove, Kitty Meeks (editors)
    Cambridge University Press, 2017
    BibTeX
  27. Enumerations of permutations simultaneously avoiding a vincular and a covincular pattern of length 3
    Christian Bean, Anders Claesson, Henning Úlfarsson
    Journal of Integer Sequences, 2017
    Journal version · BibTeX
  28. Coincidence among families of mesh patterns
    Anders Claesson, Bridget Eileen Tenner, Henning Úlfarsson
    Australasian Journal of Combinatorics, 2015
    Journal version · BibTeX
  29. Isomorphisms between pattern classes
    Michael Albert, M. D. Atkinson, Anders Claesson
    Journal of Combinatorics, 2015
    Journal version · BibTeX
  30. Subword counting and the incidence algebra
    Anders Claesson
    Preprint, 2015
    BibTeX · Timestamp
  31. An involution on bicubic maps and β(0,1)-trees
    Anders Claesson, Sergey Kitaev, Anna de Mier
    Australasian Journal of Combinatorics, 2015
    Journal version · BibTeX
  32. Decomposing labeled interval orders as pairs of permutations
    Anders Claesson, Stuart A. Hannah
    The Electronic Journal of Combinatorics, 2014
    Journal version · BibTeX
  33. An involution on β(1,0)-trees
    Anders Claesson, Sergey Kitaev, Einar Steingrímsson
    Advances in Applied Mathematics, 2013
    Journal version · BibTeX
  34. Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
    Anders Claesson, Vít Jelínek, Einar Steingrímsson
    Journal of Combinatorial Theory, Series A, 2012
    Journal version · BibTeX
  35. Sorting and preimages of pattern classes
    Anders Claesson, Henning Úlfarsson
    DMTCS Proceedings, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012
    Journal version · BibTeX
  36. n! matchings, n! posets
    Anders Claesson, Svante Linusson
    Proceedings of the American Mathematical Society, 2011
    Journal version · BibTeX
  37. Pattern avoidance in partial permutations
    Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev
    The Electronic Journal of Combinatorics, 2011
    Journal version · BibTeX
  38. Partition and composition matrices
    Anders Claesson, Mark Dukes, Martina Kubitzke
    Journal of Combinatorial Theory, Series A, 2011
    Journal version · BibTeX
  39. A direct encoding of Stoimenow’s matchings as ascent sequences
    Anders Claesson, Mark Dukes, Sergey Kitaev
    Australasian Journal of Combinatorics, 2011
    Journal version · BibTeX
  40. Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
    Petter Brändén, Anders Claesson
    The Electronic Journal of Combinatorics, 2011
    Journal version · BibTeX
  41. On the inverse image of pattern classes under bubble sort
    Michael Albert, M. D. Atkinson, Mathilde Bouvel, Anders Claesson, Mark Dukes
    Journal of Combinatorics, 2011
    Journal version · BibTeX
  42. Boolean complexes for Ferrers graphs
    Anders Claesson, Sergey Kitaev, Kári Ragnarsson, Bridget Eileen Tenner
    Australasian Journal of Combinatorics, 2010
    Journal version · BibTeX
  43. Permutations sortable by n-4 passes through a stack
    Anders Claesson, Mark Dukes, Einar Steingrímsson
    Annals of Combinatorics, 2010
    Journal version · BibTeX
  44. Descent polynomials for permutations with bounded drop size
    Fan Chung, Anders Claesson, Mark Dukes, Ronald Graham
    European Journal of Combinatorics, 2010
    Extended abstract appeared at FPSAC 2010
    Journal version · BibTeX
  45. (2+2)-free posets, ascent sequences and pattern avoiding permutations
    Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev
    Journal of Combinatorial Theory, Series A, 2010
    Extended abstract appeared at FPSAC 2009
    Journal version · BibTeX
  46. Decompositions and statistics for β(1,0)-trees and nonseparable permutations
    Anders Claesson, Sergey Kitaev, Einar Steingrímsson
    Advances in Applied Mathematics, 2009
    Journal version · BibTeX
  47. Classification of bijections between 321- and 132-avoiding permutations
    Anders Claesson, Sergey Kitaev
    Séminaire Lotharingien de Combinatoire, 2008
    Extended abstract appeared at FPSAC 2008
    Journal version · BibTeX
  48. Conway’s napkin problem
    Anders Claesson, T. Kyle Petersen
    American Mathematical Monthly, 2007
    Journal version · BibTeX
  49. Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns
    Anders Claesson, Toufik Mansour
    Ars Combinatoria, 2005
    BibTeX
  50. Counting segmented permutations using bicoloured Dyck paths
    Anders Claesson
    The Electronic Journal of Combinatorics, 2005
    Journal version · BibTeX
  51. A permutation group determined by an ordered set
    Anders Claesson, Chris D. Godsil, David G. Wagner
    Discrete Mathematics, 2003
    Journal version · BibTeX
  52. Counting occurrences of a pattern of type (1,2) or (2,1) in permutations
    Anders Claesson, Toufik Mansour
    Advances in Applied Mathematics, 2002
    Journal version · BibTeX
  53. Catalan continued fractions and increasing subsequences in permutations
    Petter Brändén, Anders Claesson, Einar Steingrímsson
    Discrete Mathematics, 2002
    Journal version · BibTeX
  54. Generalized pattern avoidance
    Anders Claesson
    European Journal of Combinatorics, 2001
    Journal version · BibTeX

Miscellaneous