akc.is  /  cv

Curriculum vitae of Anders Claesson

Anders Claesson

Research interests

Enumerative and algebraic combinatorics; in particular, permutation statistics, permutation patterns and partially ordered sets.

Employment

Education

Pedagogical education

Completed the course “Supervising post graduate research” at Strathclyde University (2012). This course qualifies me as first advisor for doctoral students in the UK.

Journal Publications and Preprints

See https://akc.is/#papers/.

Publications in Conference proceedings

  1. Counting tournament score sequences (Extended Abstract), Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB’23, Prague, August 28 - September 1, 2023, ISSN: 2788-3116, https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-040.
  2. Sorting and preimages of pattern classes, with Henning Úlfarsson, 24th International Conference on Formal Power Series & Algebraic Combinatorics (FPSAC 2012), Nagoya, July 30-August 3, 2012.
  3. Partition and composition matrices: two matrix analogues of set partitions, with Mark Dukes and Martina Kubitzke, 23rd International Conference on Formal Power Series & Algebraic Combinatorics (FPSAC 2011), Reykjavík, June 13-17, 2011.
  4. Descent polynomials for permutations with bounded drop size, with Fan Chung, Mark Dukes and Ronald Graham, The 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), San Francisco State University, August 2-6, 2010.
  5. n! matchings, n! posets, with Svante Linusson, The 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), San Francisco State University, August 2-6, 2010.
  6. Pattern avoidance in partial permutations, with Vit Jelínek, Eva Jelínková, Sergey Kitaev, The 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), San Francisco State University, August 2-6, 2010.
  7. Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations, with M. Bousquet-Mélou, M. Dukes and S. Kitaev, The 21th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), Hagenberg, Austria, July 2009.
  8. Classification of bijections between 321- and 132-avoiding permutations, with S. Kitaev, The 20th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), Valparaiso, Chile, June 2008.
  9. Generalized Pattern Avoidance, The 13th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2001), Arizona State University, May 2001.

Presentations at international conferences

  1. Plenary/Invited talk at the Scottish Combinatorics Meeting in St Andrews, Counting with sign-reversing involutions, April 2017.
  2. Plenary/Invited talk at Permutation Patterns 2016 in Washington DC, Interval orders and their interpretations in terms of permutations, June 2016.
  3. Permutation Patterns 2018 at Dartmouth College, Enumerating permutations sortable by k passes through a pop-stack, July 2018.
  4. Permutation Patterns 2015 in London, An exponential formula for counting subsets, subwords and permutation patterns, June 2015.
  5. NORCOM—The 11th Nordic Combinatorial Conference, KTH (Sweden), Upper bounds for the Stanley-Wilf limit of layered patterns, June 2013.
  6. Invited talk in a Special Session on Permutations at the AMS-MAA Joint Mathematics Meeting in San Diego, Upper bounds for the Stanley-Wilf limit of 1324, January 2013.
  7. Permutation Patterns 2011 at California Polytechnic State Unviersity, 1324-avoiders with few inversions June 2011.
  8. Aurora Borealis Combinatorics Workshop, Abisko (Sweden), Mesh Patterns, December 2010.
  9. Invited talk in a Special Session on Permutations at the AMS-MAA Joint Mathematics Meeting in San Francisco, n! matchings, n! posets, January 2010.
  10. FPSAC—International Conference on Formal Power Series and Algebraic Combinatorics, San Francisco, n! matchings, n! posets, August 2010.
  11. Permutation Patterns 2010 at Dartmouth College, Expanding permutation statistics as sums of permutation patterns, August 2010.
  12. FPSAC—International Conference on Formal Power Series and Algebraic Combinatorics, Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations, July 2009.
  13. 24th Nordic and 1st Franco-Nordic Congress of Mathematicians, Reykjavik, Permutations in new guises, Iceland, January 2005.
  14. FPSAC—International Conference on Formal Power Series and Algebraic Combinatorics, Arizona State University, Generalised pattern avoidance, May 2001.

Selected other presentations

  1. Reykjavik University, ICE-TCS, Research Seminar Series, A species approach to Rota’s twelvefold way, December 2023.
  2. Probability and Combinatorics seminar at Uppsala University, Permutations with few inversions, November 2023.
  3. Combinatorics seminar at KTH (Royal Institute of Technology, Stockholm), Caylerian Polynomials, October 2023.
  4. Combinatorics seminar at KTH (Royal Institute of Technology, Stockholm), Permutations with few inversions, May 2023.
  5. Leibniz-Zentrum für Informatik (LZI), Schloss Dagstuhl, Wadern, On the problem of Hertzsprung and similar problems, February 2023.
  6. The Icelandic Mathematical Society, University of Iceland, Fields lectures: A presentation on June Huh and his work, November 2022.
  7. Math Colloquium, University of Iceland, Pattern rewriting systems, October 2022.
  8. Math Colloquium, University of Iceland, The Goulden-Jackson cluster method, October 2022.
  9. ACPMS - Algebraic and combinatorial perspectives in the mathematical sciences, NTNU - Norges teknisk-naturvitenskapelige universitet (virtual), On the problem of Hertzsprung and similar problems, October 2022.
  10. Combinatorics Seminar, Stockholms matematikcentrum, On the problem of Hertzsprung and similar problems, April 2021.
  11. Dartmouth Combinatorics Seminar, On the problem of Hertzsprung and similar problems, January 2021.
  12. Math Colloquium, University of Iceland, On the problem of Hertzsprung and similar problems, January 2021.
  13. Institut Mittag-Leffler, Algebraic Combinatorics Online Workshop (ACOW), Pop-stack sorting, April 2020.
  14. Institut Mittag-Leffler, Counting Interval orders, February 2020.
  15. DIMAI Dipartimento di Matematica e Informatica ‘Ulisse Dini’, Università degli Studi di Firenze (University of Florence), Conway’s napkin problem, December 2018.
  16. The Icelandic Mathematical Society, University of Iceland, An introduction to combinatorial species, November 2018.
  17. The Icelandic Mathematical Society, University of Iceland, Conway’s napkin problem, May 2017.
  18. Math Colloquium, University of Iceland, Interval orders via combinatorial species and ballot matrices, February 2016.
  19. Combinatorics seminar at KTH (Royal Institute of Technology, Stockholm), Interval orders via combinatorial species and ballot matrices, November 2015.
  20. Reykjavik University, ICE-TCS, Research Seminar Series, Pascal’s matrix and incidence algebras, April 2015.
  21. Colloquium at The Open University, The monotonicity of principal pattern classes with respect to inversions, Milton Keynes, February
  22. Reykjavik University, ICE-TCS, Research Seminar Series, Interval orders can be viewed as pairs of permutations, April 2014.
  23. Computer Science and Information Science Seminars, University of Otago, Conway’s Napkin Problem, March 2010.
  24. CISeminar, University of Strathclyde, New directions in permutation patterns, September 2010.
  25. University of Iceland, Permutations in two new guises, October 2010.
  26. Combinatorics seminar at KTH (Royal Institute of Technology, Stockholm), (2+2)-free posets, ascent sequences and pattern avoiding permutations, April 2009.
  27. Combinatorics Seminar at Reykjavik University, Factors in binary strings ,February 2009.
  28. Undergraduate Mathematics Seminar Series, Reykjavik University, Conway’s Napkin Problem, November 2009.
  29. Budapesti Műszaki és Gazdaságtudományi Egyetem (BME), Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations, October 2008.
  30. Combinatorics seminar at KTH (Royal Institute of Technology, Stockholm), Stack sorting, trees and pattern avoidance, December
  31. Reykjavik University, ICE-TCS, Research Seminar Series, Stack sorting, trees and pattern avoidance, October 2007.
  32. Reykjavik University, ICE-TCS, Research Seminar Series, The generating power of continued fractions, March 2007.
  33. University of Iceland, The generating power of continued fractions, April 2007.
  34. Combinatorics seminar at KTH (Royal Institute of Technology, Stockholm), Conway’s napkin problem, December 2006.
  35. ICE-TCS Theory Day, Reykjavik University, An introduction to permutation patterns, June 2006.
  36. Reykjavik University, ICE-TCS, Research Seminar Series, May 2006.
  37. Reykjavik University, ICE-TCS, Research Seminar Series, Conway’s Napkin Problem, March 2006.
  38. The Icelandic Mathematical Society, University of Iceland, Continued Fractions and Increasing Subsequences in Permutations, October 2006.
  39. University of Iceland, October 2006.
  40. The Icelandic Mathematical Society, The art of bijections and the science of generating functions, August 2006.
  41. Mathematics Seminar at the University of Karlstad, Conways servettproblem, December 2005.
  42. Combinatorics Seminar at Chalmers University of Technology, Conways servettproblem, November 2005.
  43. Kalmars Matematiska Kollokvium, En permutationsgrupp betämd av pomängd, October 2005.
  44. Kalmars Matematiska Kollokvium, Conways servettproblem, September 2005.
  45. Kalmars Matematiska Kollokvium, Vad kedjebråk och Pascals triangel har med mönster i permutationer att göra, June 2004.
  46. Kalmars Matematiska Kollokvium, Permutationsmönster, October 2004.
  47. Summer School on Combinatorics of Groups and Algebras, CIRM, Luminy, Permutation patterns and Catalan continued fractions, July 2004.
  48. Combinatorics Seminar at Chalmers University of Technology, Gröbner bases, March 2003.
  49. Tutte Colloquium, University of Waterloo, May 2002.
  50. Combinatorics Seminar at LaBRI, Université Bordeaux 1, Generalised Pattern Avoidance, February 2001.
  51. Combinatorics Seminar at Chalmers University of Technology, Permutations, Patterns, and Binary Trees, September 2001.
  52. Combinatorics Seminar at Chalmers University of Technology, The Coding of Permutations and Set Partitions by Labelled Motzkin Paths, April 2001.
  53. Combinatorics Seminar at Chalmers University of Technology, Rook Theory, February 2001.

Posters

  1. 30th International Conference on Formal Power Series & Algebraic Combinatorics (FPSAC 2018), Dartmouth College, Enumerating permutations sortable by k passes through a pop-stack, July 2018.
  2. 24th International Conference on Formal Power Series & Algebraic Combinatorics (FPSAC 2012), Nagoya, Sorting and preimages of pattern classes, with Henning Úlfarsson, August 2012.
  3. 23rd International Conference on Formal Power Series & Algebraic Combinatorics (FPSAC 2011), Reykjavík, Partition and composition matrices: two matrix analogues of set partitions, with Mark Dukes and Martina Kubitzke, June 2011.
  4. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), Pattern avoidance in partial permutations, with Vit Jelínek, Eva Jelínková, Sergey Kitaev, August
  5. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), San Francisco State University, n! matchings, n! posets, with Svante Linusson, August 2010.
  6. 20th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), Classification of bijections between 321- and 132-avoiding permutations, with Sergey Kitaev, June 2008.

Research Grants

  1. University of Iceland Research Fund, “Score sequences and Catalan numbers”, 2022, Amount: 800,000 ISK.
  2. University of Iceland Research Fund, “Are principal pattern classes inversion-monotone?”, 2017, Amount: 700,000 ISK.
  3. Co-recipient of a project grant: Finding structure in sets of permutations, Iceland Research Fund, 2014–2016. Grant reference: 141761051, Amount: 9,790,000 ISK.
  4. University of Strathclyde Faculty of Science Starter Grant. 2011–2012, Amount: 11,000 GBP.
  5. Co-recipient of a Grant for Excellence: Combinatorics on Words and Permutations, Iceland Research Fund, 2009–2011. Grant reference: 90038011, 90038012, 90038013, Amount: 67,609,000 ISK.
  6. Postdoc grant as a part of a Grant of Excellence: Permutation patterns, Iceland Research Fund, 2006–2008. Grant reference: 60005011, 60005012, 60005013, Amount: 24,886,000 ISK.

Master’s students

Doctoral students

Honours degree projects supervised

The following are honours degree (4th year) projects that I have supervised at Strathclyde.

  1. Wojciech Jesiotr, Sorting by shifts on a torus, 2014.
  2. Graeme Hutchinson, A “Read it later” program, 2014.
  3. Scott McCullagh, Password manager, 2014.
  4. Connor Galligan, talk 3000, 2014.
  5. Kit Yiu Raymond Leung, A sorting game played on a square, 2013.
  6. Mark Graham, A distributed password manager, 2013.
  7. Ricky Dalziel, A sorting game played on a square, 2012.
  8. Stuart Paton, Catalan structures and bijections, 2012.
  9. Ross Herbertson, Sorting with primitive devices, 2012.
  10. Michael Wilson, Guess a Formula from a Sequence of Numbers, 2011.
  11. Ramadan Khadeir, Binary Strings Avoiding a Given Substring as a Factor, 2011.
  12. Jordan Haldane, A Web Program for the 8-Tile Game, 2011.
  13. Kenneth Chan, Guess a Formula from a Sequence of Numbers, 2011.

Examiner, opponent, etc.

  1. Examiner for Lapo Cioni (Università di Firenze), PhD, 2023.
  2. Examiner for Ragnar Pall Ardal (Reykjavik University), MSc, Proof-number search in automated enumeration of combinatorial classes, 2022.
  3. Examiner for Arnar Bjarni Arnarson (Reykjavik University), MSc, Substitution decomposition for permutation classes with infinitely many simple permutations, 2019.
  4. Examiner for Unnar Freyr Erlendsson (Reykjavik University), MSc, Effective enumeration of permutation classes and their juxtapositions, 2019.
  5. Examiner for Tómas Ken Magnússon (Reykjavik University), MSc, Forced permutation patterns and applications to coincidence classification of mesh patterns and enumeration of permutation classes, 2018.
  6. Opponent for Murray Tannock (Reykjavik University), MSc, Equivalence classes of mesh patterns with a dominating pattern, 2016.
  7. Internal examiner for Adam Gundry (Strathclyde), PhD, Type Inference, Haskell and Dependent Types, 2013.
  8. Convener for Pierre-Evariste Dagand (Strathclyde), PhD, Reusability and Dependent Types, 2013.
  9. Opponent for Lína Viðarsdóttir (Reykjavik University), MSc, Isomorphisms between consecutive pattern classes, 2014.
  10. Opponent for Hjalti Magnússon (Reykjavik University), MSc, Sorting Operators and Their Preimages, 2013.

Teaching experience

University of Iceland

Autumn 2021 STÆ533M - Combinatorics
Autumn 2021 STÆ303G - Algebra I
Spring 2021 STÆ202G - Sets and Metric Spaces
Autumn 2020 STÆ303G - Algebra
Autumn 2019 STÆ533M - Combinatorics
Autumn 2019 STÆ303G - Algebra I
Spring 2019 STÆ402G - Mathematical Seminar
Autumn 2018 STÆ533M - Combinatorics
Autumn 2018 STÆ303G - Algebra I
Spring 2018 STÆ403M - Algebra III
Spring 2018 STÆ402G - Mathematical Seminar
Autumn 2017 STÆ303M - Algebra I
Spring 2017 STÆ401M - Algebra II
Spring 2017 STÆ402G - Mathematical Seminar
Autumn 2016 STÆ303G - Algebra I
Spring 2016 STÆ402G - Mathematical Seminar

University of Strathclyde

Lecturer in, and responsible for, the following courses: CS101–Topics in Computing 1 (2011–2012); CS103–Machines, Languages and Computation (2012–2015); CS203–Topics in Computing 2 (2011–2013); CS316–Functional Programming (2011–2015); CS411–Theory of Computation (2013–2015).

Reykjavik University

Master students: Coadvisor for two master students: Marteinn T. Hardarson and Bergsteinn Einarsson.

New courses: Developed and taught a master level course in Generating Functions as well as an undergraduate course in Mathematics by Computer.

Existing courses: Responsible for several undergraduate courses: Number theory and abstract algebra; Financial Mathematics; Calculus for teachers; Calculus for computer scientists; Elementary Number Theory; Linear Algebra; Graph Theory (shared responsibility); Coding Theory.

University of Kalmar

Developed and taught a new course in Discrete Mathematics. Lecturer in, and responsible for, six courses: Calculus I, Calculus II, Discrete Mathematics, Linear Algebra, Graph Theory, and Mathematics for Economists. Teaching assistant in Algebra and Calculus.

Chalmers University of Technology

Lecturer in, and responsible for, two courses: Elementary Number Theory, and Discrete Mathematics. Teaching assistant in a variety of courses, such as: Calculus, Basic Algebra, Linear Algebra, Mathematical Logic, Absolute Geometry, and Discrete Mathematics.

Extracurricular

Trained the Icelandic math olympiad team in 2007, 2009, 2017 and 2020. Referee for The Baltic Way mathematical contest in 2010.