Jason O'Neill

Jason O'Neill
College of Natural and Social Sciences
Department of Mathematics
Office Location: ST F214
Email: [email protected]tatela.edu


I grew up in Berkeley, California and attended the University of California, Los Angeles for my undergraduate studies. After graduating in 2017, I pursued a Ph.D. in Mathematics at the University of California, San Diego. At UC San Diego, I was very fortunate to be advised by Jacques Verstraete and wrote my dissertation on "The combinatorics of intersecting set systems", which I successfully defended in 2022. I am now very honored to be an Assistant Professor here in the Mathematics Department at Cal State LA! My Erdös number is 2.

Outside of Math, I like to watch basketball, go for runs, and juggle. My current best is four balls, but I am working towards being able to juggle five balls. 


In the Spring 2023 semester, I will be teaching Calculus 1 (Math 2110). The corresponding course material will be posted on Canvas. Please feel free to email me if you are interested in Combinatorics research and/or would like to explore a directed reading course.  

Past Teaching: 

In the Fall 2022 semester, I taught Calculus 3 (Math 2130) and Theory of Probability (Math 4740).  I maintain course lecture notes for these courses and these complete set of course notes can be made avaliable via email request. 

AMC Faculty Coordinator: 

Together with Tuyetdong Phan-Yamada, I help organize the American Mathematics Competitions (AMC) at Cal State LA. We offer the AMC 8, AMC 10 and AMC 12, where the numerical value corresponds to the latest grade a student can be in while taking the corresponding exam. If you know someone interested in taking the exam, please feel free to email me ([email protected]) or  Tuyetdong Phan-Yamada ([email protected]). 

More information on the exam and other mathematics extracurricular activies may be found at the Cal State LA Math Circle website -- https://www.calstatela.edu/orgs/mathcircle.

Research Interests: 

My research interests lie in extremal combinatroics. Broadly speaking, extremal combinatorics entails maximizing the size of a collection of objects given constraints on the collection of objects.

Papers and preprints: