Jason P. Smith

I am a research fellow in the Department of Mathematics at the University of Aberdeen, working on the project "Topological Analysis of Neural Systems" with Prof. Ran Levi. My main areas of interest are Combinatorics and Topology.

Email:

Google Scholar page

CV

My Papers:
The Abelian Sandpile Model on Ferrers Graphs - A Classification of Recurrent Configurations,
with Mark Dukes, Thomas Selig and Einar Steingrímsson, arXiv.
The Poset of Graphs Ordered by Induced Containment, arXiv.
The Poset of Mesh Patterns,
with Henning Ulfarsson, arXiv.
EW-Tableaux, Le-Tableaux, Tree-like Tableaux and the Abelian Sandpile Model,
with Thomas Selig and Einar Steingrímsson, The Electronic Journal of Combinatorics 25(3) (2018), P14. arXiv.
Modular Decomposition of Graphs and the Distance Preserving Property,
with Emad Zahedi, arXiv.
On Distance Preserving and Sequentially Distance Preserving Graphs,
with Emad Zahedi, arXiv.
On the Möbius Function and Topology of General Pattern Posets, arXiv.
A Formula for the Möbius Function of the Permutation Poset Based on a Topological Decomposition,
Advances in Applied Mathematics 91 (2017), pp. 98-114, arXiv.
Intervals of Permutations with a Fixed Number of Descents are Shellable,
Discrete Mathematics 339 (2016), pp. 118-126. arXiv.
On the Möbius Function of Permutations With One Descent,
The Electronic Journal of Combinatorics 21(2) (2014), P11. arXiv.

Presentations:
Intervals of Permutations with a Fixed Number of Descents are Shellable.
Combinatorial Algebraic Topology and its Applications to Permutation Patterns.
A Formula for the Möbius Function of the Permutation Poset.

Programs:
A program for computing the Möbius function of intervals of the permutation poset.

Education:
Ph.D in Computer and Information Science. University of Strathclyde. 2012-2015. Advisor: Einar Steingrímsson.
Thesis: On the Möbius Function and Topology of the Permutation Poset
MMath. University of Bath. 2008-2012.