Assistant Professor
Department of Mathematical and Statistical Sciences
Courses Taught
- Calculus
- Discrete Mathematics
- Foundations of Mathematics
- Applied Combinatorics
- Theory of Computation
- Applied Linear Algebra
- Scientific Computing
Research Interests
- Computational and experimental symbolic methods
- Combinatorics
- Analytic and symbolic combinatorics
- Computer algebra
- Statistical mechanics
Recent Publications
- J. Pantone, A. Klotz, and E. Sullivan. Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height. Under consideration. 33pp.
- M. Albert, C. Bean, A. Claesson, É. Nadeau, J. Pantone, and H. Ulfarsson. Combinatorial Exploration: An algorithmic framework for enumeration. Under consideration. 99pp.
- C. Bean, A. Claesson, A.F. Franklín, J. Pantone, and H. Ulfarsson. Restricted permutations enumerated by number of inversions. Electronic Proceedings in Theoretical Computer Science. 403 (2024): 96-100.
- C. Bean, É. Nadeau, J. Pantone, and H. Ulfarsson. Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding. Electronic Journal of Combinatorics. 31, 3 (2024), Paper 3.3, 19pp.
- J. Pantone. The enumeration of inversion sequences avoiding the patterns 201 and 210. Enumerative Combinatorics and Applications. 4, 4 (2024), Paper No. S2R25, 12pp.
- M. Bóna and J. Pantone. Permutations avoiding sets of patterns with long monotone subsequences. Journal of Symbolic Computation. 116 (2023), 130-138.
- A. Claesson, B. Guðmundsson, and J. Pantone. Counting pop-stacked permutations in polynomial time. Experimental Mathematics. (2023): 1-8.
Grants
2024:
- NSF Improving Undergraduate STEM Education: Division of Undergraduate Education (IUSE: DUE). AI-HELP: Artificial Intelligence for Humanizing and Enhancing the Learning of Proofs. $749,996. August 2024 - July 2026. Joint project with the University of Florida, Education Development Center, and St. Olaf College.
2020:
- Received five-year Simons Collaboration Grant for Enumerative and Experimental Combinatorics. $42,000.
Research Software
Github repository: https://github.com/jaypantone
- Permutation Pattern Avoidance Library (PermPAL). An online database of permutation pattern avoidance classes and their enumerations.
https://permpal.com
- FiniteStateMachines. Open-source Python library to construct and manipulate several kinds of finite state machines.
https://github.com/jaypantone/FiniteStateMachines
doi: 10.5281/zenodo.4592555
- DiffApprox. Open-source Maple package to empirically predict the asymptotic behavior of
counting sequences based on known initial terms.
https://github.com/jaypantone/DiffApprox
doi: 10.5281/zenodo.5810652
- GuessFunc. Open-source Maple package to conjecture generating functions of counting sequences based on known initial terms.
https://github.com/jaypantone/guessfunc
doi: 10.5281/zenodo.5810636
- CombSpecSearcher / Tilings. Open-source Python libraries that implement the Combinatorial Exploration framework and apply it to the field of permutation patterns. Co-authored with Christian Bean, Émile Nadeau, and Henning Ulfarsson.
https://github.com/PermutaTriangle/comb_spec_searcher
doi: 10.5281/zenodo.4946832
https://github.com/PermutaTriangle/Tilings
doi: 10.5281/zenodo.4948344
- Permuta. Open-source Python library for working with permutations and patterns. Successor (in part) to PermPy. Co-authored with many other contributors.
https://github.com/PermutaTriangle/Permuta
doi: 10.5281/zenodo.4725758
- Distributed Superpermutation Search. Created a web-based application to manage a worldwide distributed computational effort to compute the shortest superpermutation containing all permutations of length 6. Over a million computers participated in this effort and over a hundred million CPU-hours were contributed. Co-authored largely with Greg Egan.
https://github.com/jaypantone/superperm
- PermPy. Open-source Python library for handling large sets of permutations. Co-authored with Michael Engen and Cheyne Homberger.
https://github.com/engenmt/permpy
