Gergely Ambrus (University of Szeged): Piercing the chessboard |
![]() |
|||
|
||||
|
||||
Abstract. How many lines are needed to pierce each cell of the n*n chessboard? We give nontrivial upper and lower bounds, study related problems, and present an intriguing conjecture on the optimal number of lines. Joint work with I. Bárány, P. Frankl and D. Varga. *A szemináriumot Zoom-on is közvetíteni fogjuk a https://zoom.us/j/2632883189 linken. |
||||
Location : Riesz Lecture Hall |
JEvents v3.1.8 Stable Copyright © 2006-2013