universitet) at the Discrete Mathematics seminar, KIT, Germany.
https://www.math.kit.edu/iag6/edu/agdiscrmath2024w/
*Title:* Around the log-rank conjecture.
*Abstract:* The log-rank conjecture, proposed by Lovász and Saks, is one of
the fundamental problems of communication complexity. In its combinatorial
formulation, it asks for the size of the largest all-zero or all-one
submatrix of a binary matrix of rank r. I will talk about recent questions
and developments surrounding this conjecture. Based on joint works with
Zach Hunter, Aleksa Milojevic and Benny Sudakov.
The seminar will take place on Zoom on Thursday, January 23 at 14:00 CET.
Join Zoom Meeting
https://kit-lecture.zoom-x.de/j/4341534439?pwd=WS2sFvtCTK230vatxHgdz7784z54HD.1&omn=68747822121
Meeting ID: 434 153 4439
Passcode: @89aKPFG
Kind regards,
Maria Aksenovich and Arsenii Sagdeev (KIT)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
