Home Page 

Shoni Gilboa, Senior Lecturer

Contact Info

The Open University of Israel Department of Mathematics and Computer Science 1 University Road P.O.B. 808 Ra’anana 4353701, Israel
Office:972-9-778-2206 Email:shoni AT openu DOT ac DOT il

Additional Information

My birth name is Shoni Dar; I took my wife's surname Gilboa when we married.
I won a gold medal in the 29th International Mathematical Olympiad.
I completed with distinction my Ph.D. studies in the School of Mathematical Sciences at Tel Aviv University, under the supervision of Prof. Vitali Milman.

My research interests lie primarily in Geometry, Analysis, Probability and Combinatorics.

S. Gilboa and D. Hefetz, Semi-random process without replacement, Journal of Combinatorics 14 (2023), no. 2, 167-196.

S. Gilboa, P. Haim-Kislev and B. A. Slomka, Isobarycentric inequalities, International Mathematics Research Notices, 2022 (online), 26 pages.

I. Benjamini and S. Gilboa, The maximal number of 3-term arithmetic progressions in finite sets in different geometries, Discrete and Computational Geometry, 2022 (online), 25 pages.

S. Gilboa, R. Glebov, D. Hefetz, N. Linial and A. Morgenstern, On the local structure of oriented graphs – a case study in flag algebras, The Electronic Journal of Combinatorics, 29 (2022), no. 3, Article P3.39, 53pp.

S. Gilboa and E. Lapid, Some combinatorial results on smooth permutations, Journal of Combinatorics 12 (2021), no. 2, 303–354.

S. Gilboa and S. Gueron, The advantage of truncated permutations, Discrete Appl. Math. 294 (2021), 214–223.

S. Gilboa and E. Lapid, Some combinatorial results on smooth permutations, Sém. Lothar. Combin. 84B (2020), Art. 81, 10 pp. 

N. Alon, S. Gilboa and S. Gueron, A probabilistic variant of Sperner's theorem and of maximal r-cover free families, Discrete Math. 343 (2020), no. 10, 112027, 4 pp. 

S. Gilboa, S. Gueron and B. Morris, How many queries are needed to distinguish a truncated random permutation from a random function?, J. Cryptology 31 (2018), no. 1, 162–171. 

S. Gilboa and R. Peled, Chebyshev-type quadratures for doubling weights, Constr. Approx. 45 (2017), no. 2, 193–216. 

S. Gilboa and D. Hefetz, On degree anti-Ramsey numbers, European J. Combin. 60 (2017), 31–41. 

S. Gilboa, S. Gueron and M. Nandi, Balanced permutations Even–Mansour ciphers, Cryptography  1 (2017), no. 2. 

S. Gilboa and Y. Roditty, Anti-Ramsey numbers of graphs with small connected components, Graphs Combin. 32 (2016), no. 2, 649–662.

A. Bialostocki, S. Gilboa and Y. Roditty, Anti-Ramsey numbers of small graphs, Ars Combin. 123 (2015), 41–53. 

S. Gilboa and R. Peled, A differential version of the Chebyshev–Markov–Stieltjes inequalities, J. Approx. Theory 196 (2015), 13–54. 

S. Gilboa and S. Gueron, Distinguishing a truncated random permutation from a random function, arXiv:1508.00462 (2015), 17 pages.

S. Gilboa and R. Pinchasi, On the union of arithmetic progressions, SIAM J. Discrete Math. 28 (2014), no. 3, 1062–1073. 

N. Alon, S. Dar, M. Parnas and D. Ron, Testing of clustering, SIAM Rev. 46 (2004), no. 2, 285–308. 

N. Alon, S. Dar, M. Parnas and D. Ron, Testing of clustering, SIAM J. Discrete Math. 16 (2003), no. 3, 393–417. 

S. Dar and S. Gueron, A weighted Erdős–Mordell inequality, Amer. Math. Monthly 108 (2001), no. 2, 165–168. 

S. Dar, A Brunn–Minkowski-type inequality, Geom. Dedicata 77 (1999), no. 1, 1–9. 

S. Alesker, S. Dar and V. Milman, A remarkable measure preserving diffeomorphism between two convex bodies in IRn, Geom. Dedicata 74 (1999), no. 2, 201–212. 

S. Dar, Isotropic constants of Schatten class spaces, in Convex geometric analysis (Berkeley, CA, 1996), 77–80, Math. Sci. Res. Inst. Publ., 34, Cambridge Univ. Press, Cambridge, 1998. 

S. Dar, On the isotropic constant of non-symmetric convex bodies, Israel J. Math. 97 (1997), 151–156. 

S. Dar, Remarks on Bourgain's problem on slicing of convex bodies, in Geometric aspects of functional analysis (Israel, 1992–1994), 61–66, Oper. Theory Adv. Appl., 77, Birkhäuser, Basel, 1995.