SoCalDM is a friendly, day-long research conference designed for discrete mathematicians in Southern California. For more details please visit the conference website:

https://sites.google.com/view/socaldm2025/home

Here is the schedule for the event: 

9:00-9:30 Welcome coffee

9:30-10:00 Jonathan Davidson (Cal State LA), A Combinatorial Design Approach to a Multicolor Bipartite Ramsey Problem

10:10-10:40 Lenny Fukshansky (Claremont McKenna College), On a new absolute version of Siegel’s lemma

10:40-11:00 Coffee Break

11:00-11:30 Mason Shurman (UCI), Covering Random Digraphs with Hamilton Cycles

11:40-12:10 Claire Levaillant (USC), Solutions to the Diophantine equation $\sum_{i=1}^n\frac{1}{x_i}=1$ in integers of the form p^a*q^b with p and q two distinct primes. 

12:10-2:00 Lunch

2:00-2:30 Sehun Jeong (Claremont Graduate University), Integral quadratic forms and lattice angles

2:40-3:10 Justin Troyka (Cal State LA), Growth rates of permutations with given descent or peak set

3:20-3:50 Yizhe Zhu (USC), CLTs for linear spectral statistics of inhomogeneous random graphs

TBA

Is there a natural way to order data in dimension greater than one? The approach based on the notion of data depth, often associated with the name of John Tukey, is among the most popular. Tukey’s depth has found applications in robust statistics, the study of elections and social choice, and graph theory. We will give an introduction to the topic (with an emphasis on robust statistics), describe some remaining open questions as well as our recent progress towards the solutions.

This talk is based on the joint work with Yinan Shen.

TBA