Jason Long
I used to be a Postdoctoral Researcher in mathematics at the University of Oxford, working with Professor Peter Keevash. I was also a Stipendiary Lecturer at Mansfield College. Before this, I was a PhD student in DPMMS at the University of Cambridge under the supervision of Professor Tim Gowers.
I now work in industry, where I started at J. P. Morgan AI Research working in the area of Explainable AI, and then moved again to work at Squarepoint Capital. I still think about maths whenever I can find the time.
Email me at jasonlong272 (at) gmail (dot) com.
Research Interests
Research-wise, I am mostly interested in combinatorics, particularly extremal and probabilistic graph theory and problems on hypergraphs.
I have also worked on the interface between combinatorics and algebra, mostly on problems related to character theory of Sn.
More recently I have worked in AI on explainability and optimisation.
Papers
The following is a list of papers and preprints. If the paper has been uploaded to arXiv a link has been provided; feel free to email me for more details about any project.
Mathematics
Combinatorics
Simplicial homeomorphs and trace-bounded hypergraphs, with B. Narayanan and C. Yap. Discrete Analysis, 2022. arXiv:2011.08167
The Brown-Erdős-Sós conjecture for hypergraphs of large uniformity, with P. Keevash. Proceedings of the AMS, 2020. arXiv:2007.14824
Partial associativity and rough approximate groups, with W. T. Gowers. Geom. Funct. Anal., 2020. arXiv:1904.08732
A universal exponent for homeomorphs, with P. Keevash, B. Narayanan and A. Scott. Israel J. Maths, 2020. arXiv:2004.02657
The extremal number of Venn diagrams, with P. Keevash, I. Leader and A. Wagner. Proceedings of the AMS, 2019. arXiv:1911.00487
A note on the Brown-Erdős-Sós conjecture in finite groups. Combinatorics, Probability and Computing, 2019. arXiv:1902.07693
The largest projective cube-free subsets of Z_(2^n), with A. Wagner. European J. Combin., 2018. arXiv:1810.01225.
Partition problems in high dimensional boxes, with M. Bucic, B. Lidicky and A. Wagner. J. Combin. Theory (Series A), 2018. arXiv:1805.11278.
Diffusion on graphs is eventually periodic, with B. Narayanan. Journal of Combinatorics, 2017. arXiv:1704.04295.
The length of an s-increasing sequence of r-tuples, with W. T. Gowers. Combinatorics, Probability and Computing, 2017. arXiv:1609.08688.
Algebra
Sylow branching coefficients and a conjecture of Malle and Navarro, with E. Giannelli, S. Law and C. Vallejo. B. Lond. Math. Soc., 2021 arXiv:2102.06784
Linear characters of Sylow subgroups of symmetric groups, with E. Giannelli and S. Law. Journal of Algebra, 2021. arXiv:2010.07631
AI
Conference papers
Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction, with Marc Rigter, Danial Dervovic, Parisa Hassanzadeh, Parisa Zehtabi and Daniele Magazzeni AAAI, 2022. arXiv:2203.08019
Counterfactual Shapley Additive Explanations, with Emanuele Albini, Danial Dervovic and Daniele Magazzenni, FAccT 2022. arXiv:2110.14270
Robust Counterfactual Explanations for Tree-Based Ensembles, with Sanghamitra Dutta, Saumitra Mishra, Cecilia Tilli and Daniele Magazzeni, ICML 2022. arXiv:2207.02739
Workshop papers
A Survey on the Robustness of Feature Importance and Counterfactual Explanations, with Saumitra Mishra, Sanghamitra Dutta and Daniele Magazzeni, Workshop on Explainable AI in Finance 2021 (XAI-FIN21). arXiv:2111.00358
Counterfactual Explanations for Arbitrary Regression Models, with Thomas Spooner, Danial Dervovic, Jon Shepard, Jiahao Chen and Daniele Magazzeni. ICML '21 Workshop on Algorithmic Recourse. arXiv:2106.15212