Eliminating Cycles in the Torus
I will discuss the problem of cutting the (discrete or continuous) d-dimensional torus economically, so that no nontrivial cycle remains. This improves, simplifies and/or unifies results of Bollobas, Kindler, Leader and O’Donnell, of Raz and of Kindler, O’Donnell, Rao and Wigderson. More formal, detailed abstract(s) appear in http://www.math.tau.ac.il/~nogaa/PDFS/torus3.pdf and in http://www.math.tau.ac.il/~nogaa/PDFS/torusone1.pdf.
Joint work with Bo’az Klartag.
Noga Alon is a Baumritter Professor of Mathematics and Computer Science in Tel Aviv University, Israel. He received his Ph. D. in Mathematics at the Hebrew University of Jerusalem in 1983 and had visiting positions in various research institutes including MIT, The Institute for Advanced Study in Princeton, IBM Almaden Research Center, Bell Laboratories, Bellcore and Microsoft Research. He serves on the editorial boards of more than a dozen international technical journals and has given invited lectures in many conferences, including plenary addresses in the 1996 European Congress of Mathematics and in the 2002 International Congress of Mathematician. He published more than four hundred research papers, mostly in Combinatorics and in Theoretical Computer Science, and one book. He is a member of the Israel National Academy of Sciences since 1997 and of the Academia Europaea since 2008, and received the Erdös prize in 1989, the Feher prize in 1991, the Polya Prize in 2000, the Bruno Memorial Award in 2001, the Landau Prize in 2005, the Gödel Prize in 2005 and the Israel Prize in 2008.
- Noga Alon
- Tel Aviv University