PhD Student in Mathematics Advisor: Benny Sudakov Department of Mathematics ETH Zürich Contact Info
Check out my research featured in Quanta magazine - A New Path to Equal-Angle Lines Curriculum Vitae: CV |

- Spring 2017 - teaching assistant for Graph Theory, ETH Zurich.
- Spring 2016 - teaching assistant for Seminar on Elementary Number Theory, ETH Zurich.
- Spring 2012 - teaching assistant for Matrix Theory, Carnegie Mellon University.
- Spring 2010 - teaching assistant for Graph Theory, Carnegie Mellon University.

- I. Balla, A. Pokrovskiy and B. Sudakov, A remark on Hamilton cycles with few colors, (2017), submitted.
- I. Balla and B. Sudakov, Equiangular subspaces in Euclidean spaces, (2017), submitted.
- I. Balla, F. Dräxler, P. Keevash and B. Sudakov, Equiangular Lines and Spherical Codes in Euclidean Space, Inventiones Mathematicae (2017).
- I. Balla, A. Pokrovskiy and B. Sudakov, Ramsey goodness of bounded degree trees, (2016), submitted.
- I. Balla, B. Bollobás and T. Eccles, Union-closed families of sets, Journal of Combinatorial Theory Series A 120 (2013), no. 3, 531-544.
- I. Balla, Minimum density of union-closed families, arXiv:1106.0369v1 (2011).

- October 2017 - Equiangular Subspaces, Mittagsseminar, ETH Zurich.
- August 2017 - Equiangular Lines and Subspaces in Euclidean Spaces, Eurocomb, Vienna.
- August 2017 - Ramsey Goodness of Bounded Degree Trees, Random Structures and Algorithms, Gniezno.
- January 2017 - Equiangular Lines and Spherical Codes, Workshop on Combinatorics, Oberwolfach.
- June 2016 - Ramsey Goodness of Bounded Degree Trees, SIAM Conference on Discrete Mathematics, Georgia State University.
- April 2016 - Equiangular Lines, Mittagsseminar, ETH Zurich.
- November 2014 - Noisy population recovery, CS Student Seminar, Courant Institute, NYU.
- April 2014 - Coloring planar graphs, cSplash, Courant Institute, NYU.
- September 2012 - Extremal results for union-closed families, Discrete Mathematics Seminar, Rutgers University.
- March 2012 - Extremal results for union-closed families, Algorithms, Combinatorics, and Optimization Seminar, Carnegie Mellon University.