Sam Spiro

Email: sas703 {at} scarletmail.rutgers [dot] edu
Office: Hill 207

I am an NSF Mathematical Sciences Postdoctoral Research Fellow at Rutgers University under the supervision of Bhargav Narayanan and am currently on the job market. Previously I was a PhD student at UC San Diego under the supervision of Jacques Verstraëte, and partially under the supervision of Fan Chung. My CV can be found here.

My research interests are in combinatorics, and I am particularly interested in graph theory, extremal combinatorics, and probabilistic combinatorics. Many of the problems I work on involve extremal properties of F-free hypergraphs and of random objects such as random graphs and permutations; but I am happy to work on any problem as long as it's interesting or fun!

Selected publications:

• The Reverse Littlewood–Offord problem of Erdos (with Xiaoyu He, Tomas Juskevicius, and Bhargav Narayanan).
  Submitted, 2024.


• Supersaturation of Tree Posets (with Tao Jiang, Sean Longbrake, and Liana Yepremyan).
  Submitted, 2024.


• Sidorenko Hypergraphs and Random Turan Numbers (with Jiaxi Nie).
  Submitted, 2023.


• The Random Turan Problem for Theta Graphs (with Gwen McKinley).
  Submitted, 2023.


• Eulerian Polynomials for Digraphs (with Kyle Celano and Nicholas Sieger).
  Combinatorial Theory (Accepted), 2023. Conference poster at Formal Power Series and Algebraic Combinatorics, 2023


• Card Guessing with Partial Feedback (with Persi Diaconis, Ron Graham, and Xiaoyu He).
  Combinatorics, Probability, and Computing, 2020.


• Antichain Codes (with Benjamin Gunby, Xiaoyu He, and Bhargav Narayanan).
  Bulletin of the London Mathematical Society, 2022.


• A Smoother Notion of Spread Hypergraphs.
  Combinatorics, Probability, and Computing, 2021.