[Colloquium] U of C - CS Theory Seminar - Elyassaf Loyfer , October 8, 2024

[Jose J Fragoso via Colloquium]

UNIVERSITY OF CHICAGO
COMPUTER SCIENCE DEPARTMENT
PRESENTS



Elyassaf Loyfer
Hebrew University of Jerusalem


[cid:image001.png at 01DB163C.761CCF50]


Tuesday, October 8, 2024 at 3:30pm
Location: Kent 102

 Title:  Rate vs. Distance - Milestones and Obstacles Towards Improved Bounds*
            (*no bounds were harmed (yet) in the making of this research)

Abstract:  The rate vs. distance problem is a major open problem of coding theory. Significant progress has stalled since 1977. The best-known upper bound, established by MRRW, is derived from Delsarte’s reformulation of the combinatorial question as a linear program (LP). This breakthrough sparked a line of research into stronger optimization problems. However, the more powerful formulations have remained difficult to analyze, and no improved bounds have been achieved yet. In this talk, I will present new results on the analysis of a recently developed LP hierarchy. I will discuss the techniques employed, current limitations, and possible strategies to deal with these challenges.

Based on joint work with Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones, and Nati Linial



 Bio:  Elyassaf Loyfer is a PhD student in the School of Computer Science at the Hebrew University of Jerusalem, working under the supervision of Prof. Nati Linial. He has a broad interest in theoretical computer science and combinatorics.





Host: Alexander Razborov



-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20241008/139214ef/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image001.png
Type: image/png
Size: 104384 bytes
Desc: image001.png
URL: <http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20241008/139214ef/attachment-0001.png>