Jan Snellman

Education

• Licentiate of Philosophy (filosofie licentiat, fil.lic.) in Mathematics, Stockholm University, 1996 — the Swedish intermediate postgraduate degree, roughly half a doctorate.
• PhD in Mathematics (filosofie doktor, fil.dr), Stockholm University, 1998. Thesis: A graded subring of an inverse limit of polynomial rings. Advisor: Jörgen Backelin.
• Docent, Linköping University, 21 November 2006.

Appointments

• 1996–1998 — Cryptography, Försvarets radioanstalt (FRA), the Swedish National Defence
  Radio Establishment.
• 1998–1999 — Postdoctoral researcher (stagiaire post-doc), Laboratoire GAGE, École
  Polytechnique, Palaiseau, France. About a year, from the autumn of 1998. Funded by Centre
  International des Étudiants et Stagiaires and Svenska institutet. Laboratory head: Marc Giusti; host: Guillermo Moreno-Socías.
• 1999–2000 — Postdoctoral researcher, School of Informatics, University of Wales, Bangor.
  Autumn 1999 to late summer 2000. Group leader: Ronnie Brown.
• 2000–2001 — Temporary lecturer, Department of Mathematics (MAI), Linköping University, from the start of the autumn 2000 term.
• 2001–2005 — Forskarassistent, Department of Mathematics, Stockholm University, from
  late 2001.
• 2005–present — Universitetslektor, Department of Mathematics (MAI), Linköping University.

Research programmes

Spring 2005 — participant, the semester programme on Algebraic Combinatorics,
Institut Mittag-Leffler.

Doctoral students

• Jonna Gill, 2013 — The k-assignment polytope, phylogenetic trees, and permutation
  patterns. Principal supervisor.
• Mikael Hansson, 2018 — Combinatorics and topology related to involutions in Coxeter
  groups. Assistant supervisor.
• Vincent Umutabazi, 2022 — Boolean complexes of involutions and smooth intervals in Coxeter groups. Assistant supervisor.

Bachelor's and Master's thesis students, as advisor

At Stockholm University

- Michael Paulsen, 2003 — Enumerativa egenskaper för konkava partitioner av heltal.
Parts published in Journal of Integer Sequences 7 (2004).
- Elin Gawell, 2005 — Rings of arithmetic functions with regular convolutions.

At Linköping University

• Kåre Krig, 2010 — Methods for phylogenetic analysis (Master's; with Svante Linusson)
• Olle Abrahamsson, 2016 — A Gröbner basis algorithm for fast encoding of Reed–Müller codes
• Ludwig Rahm, 2017 — Generating functions and regular languages of walks with modular
  restrictions in graphs
• Aliaksandra Kupreyeva, 2019 — Simplices of f-vectors
• Albin Jaldevik, 2022 — A study on Poset Probability
• Oliver Pavlić, 2025 — Failure and recovery of unique factorization in the rings of integers

Links

• Personal homepage
• Blog