Theory Lunch Seminar - Zeyu Zheng

— 1:00pm

Location:
In Person - Gates Hillman 8102

Speaker:
ZEYU ZHENG , Ph.D. Studnt, Ph.D. Program in Algortihms, Combinatorics and Optimization, Department of Mathematical Sciences, Carnegie Mellon University
https://zeyu-zheng.github.io/

The generalized trifference problem

We study the problem of finding the largest number T(n,m) of ternary vectors of length n such that for any three distinct vectors there are at least m coordinates where they pairwise differ.
   For m=1, this is the classical trifference problem which is wide open.
   We prove upper and lower bounds on T(n,m) for various ranges of the parameter m and determine the
   phase transition threshold on m=m(n) where T(n,m) jumps from constant to exponential in n.
By relating the linear version of this problem to a problem on blocking sets in finite geometry, we give explicit constructions and probabilistic lower bounds.

Joint work with Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács, Zoltán Lóránt Nagy, Gábor Somlai, and Máté Vizer. 

For More Information:
hfleisch@andrew.cmu.edu

Add event to Google
Add event to iCal