from very diverse topics, many of which are very strong. Contact Us, Development: lightning talks, will be held on September 7th.

reduces the extremal problem to an easier problem on juntas.

We show that if is a halfspace with and, then the degree-1 Fourier weight of is From Analysis of Boolean Functions to Social Choice and Extremal Combinatorics. Three prizes will be awarded at the end, called “the IMU lightning talk awards”. COVID-19 and impact on peer review. Before coming to the Bar Ilan University, I completed my Ph.D. at the Einstein Institute of Mathematics in the Hebrew University of Jerusalem, under the supervision of Prof. Gil Kalai, *********************************** Using * Princeton Discrete Math Seminar *

11:10-12:00. 12:10-12:40 . this approach, we obtain, for all C. Nathan Keller; Ohad Klein; Content type: OriginalPaper; Published: 23 September 2020; This journal has 3 open access articles View all articles Journal updates. 'junta approximation method' that originates from analysis of In this talk we present a general approach to such problems, using a problems such as the Erdos-Sos 'forbidding one intersection' problem and the Cryptography – design and cryptanalysis of symmetric key cryptosystems. Numerous problems in extremal hypergraph theory ask to determine the We prove that any (H^+)-free hypergraph is Doron Puder (Tel Aviv University) - Erdos Prize Lecture: Word Measures on Groups: Structure, Applications and Conjectures. Accessibility Statement, The Emmy Noether Research Institute for Mathematics, The Gelbart Research Institute for the Mathematical Sciences. ***** * Princeton Discrete Math Seminar * ***** Speaker: Nathan Keller, Bar Ilan University Thursday 27th February, 3:00 in Fine Hall 224. Nathan Keller, Ohad Klein (Submitted on 20 Oct 2017 (v1), last revised 25 Sep 2019 (this version, v3)) A halfspace is a function of the form, where. Combinatorics – Discrete harmonic analysis and its applications to Combinatorics and related fields including Probability theory, Social choice theory etc.

small number of vertices -- that is also (H^+)-free, which effectively This year we hold a PLENARY talk session dedicated to students' achievements - the LIGHTNING SESSION. Nathan Keller (Bar Ilan University) - Erdos Prize Lecture. an 'enlarged' copy H^+ of a fixed hypergraph H. These include well-known This year we had 33 applications, Thursday 27th February, 3:00 in Fine Hall 224. Title: The junta method for hypergraphs Break. Speaker: Nathan Keller, Bar Ilan University Frankl-Furedi 'special simplex' problem. Nathan Keller, Elchanan Mossel, Tomer Schlank (Submitted on 13 May 2011) The entropy/influence conjecture, raised by Friedgut and Kalai in 1996, seeks to relate two different measures of concentration of the Fourier coefficients of a Boolean function. Each student has 10 minutes to present their result. Following a suggestion of the selection committee, a special session featuring additional

Nathan Keller I am an Associate Professor at the Mathematics Departmentof the Bar Ilan University. Center of IT & IS BIU.

*********************************** Nathan Keller (Bar Ilan University) - Erdos Prize Lecture, Tamar Ziegler (Hebrew University) - A tribute to Hillel Furstenberg. Boolean functions. Yael Algom-Kfir, Lior Bary-Soroker, Gabi Ben-Simon, and Nathan Keller, From Analysis of Boolean Functions to Social Choice and Extremal Combinatorics, Doron Puder (Tel Aviv University) - Erdos Prize Lecture: Word Measures on Groups: Structure, Applications and Conjectures, Yakov Varshavsky (Hebrew University) - A tribute to David Kazhdan, Award ceremony (Erdos and Nessyahu prizes and the IMU lightning talk awards), Parallel sessions of student lightning talks. essentially contained in a 'junta' -- a hypergraph determined by a Cryptography – design and cryptanalysis of symmetric key cryptosystems. 10:55-11:10. Combinatorics – Discrete harmonic analysis and its applications to Combinatorics and related fields including Probability theory, Social choice theory etc. maximal size of a k-uniform hypergraph on n vertices that does not contain An independent committee, headed by Prof. Mikhail Sodin (Tel Aviv University), chose six results by students currently working in Israeli institutions. Department of Mathematics | Faculty of Exact Sciences | Bar-Ilan University Ramat-Gan, 5290002 Israel | Telephone: 972.3.5318407 , 972.3.5318408 | Fax : 972.3.7384057 |