béla bollobás memphis guy kindler microsoft imre leader cambridge ryan o’donnell microsoft
TRANSCRIPT
![Page 1: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/1.jpg)
Béla BollobásMemphis
Guy KindlerMicrosoft
Imre LeaderCambridge
Ryan O’DonnellMicrosoft
![Page 2: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/2.jpg)
Q: How many
vertices need be
deleted to block
non-trivial cycles?
![Page 3: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/3.jpg)
(with “L1 edge structure”)
Q: How many
vertices need be
deleted to block
non-trivial cycles?
Upper bound: d ¢
md−1
Upper bound: d ¢
md−1
![Page 4: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/4.jpg)
(with “L1 edge structure”)
Q: How many
vertices need be
deleted to block
non-trivial cycles?
Upper bound: d ¢
md−1
Lower bound: 1 ¢
md−1
A: ? ¢ md−1
Lower bound:
![Page 5: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/5.jpg)
Motivation
Upper:
Lower: m
2 ¢
m
¢
m
Best:
![Page 6: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/6.jpg)
![Page 7: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/7.jpg)
![Page 8: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/8.jpg)
tiling of with period
(with discretized boundary)
![Page 9: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/9.jpg)
tiling of with period
(with discretized boundary)
![Page 10: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/10.jpg)
0
m
# of vertices:
Theorem 1:
upper bound, for d = 2r.
(Hadamard matrix)
In dimension d = 2r…
![Page 11: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/11.jpg)
Motivation
• “L1 structure”:
• [SSZ04]: Asymptotically tight lower bound.
(Yields integrality gap for DIRECTED MIN MULTICUT.)
• Our Theorem 2: Exactly tight lower bound.
• Edge-deletion version: Our original motivation.
Connected to quantitative aspects of Raz’s Parallel Repetition Theorem.
![Page 12: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/12.jpg)
Open questions
• Obviously, better upper/lower bounds for various versions?
(L1 / L1, vertex deletion / edge deletion)
• Continuous, Euclidean version:
“What tiling of with period has minimal surface area?”
Trivial upper bound: d
Easy lower bound:
No essential improvement known.
Best for d = 2:
![Page 13: Béla Bollobás Memphis Guy Kindler Microsoft Imre Leader Cambridge Ryan O’Donnell Microsoft](https://reader035.vdocument.in/reader035/viewer/2022070415/5697bfa71a28abf838c98e04/html5/thumbnails/13.jpg)