Boris Bukh

Boris Bukh is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University. His research interests include combinatorial problems with algebraic and geometric aspects, such as Turán problems, geometric selection theorems, combinatorial number theory, and codes. He has published extensively in areas like extremal graph theory, combinatorial geometry, and discrete mathematics. His work includes studies on the maximum number of edges in graphs without certain subgraphs, approximation of point sets, and properties of sets of numbers. Bukh's research has been featured in prominent journals such as the Journal of the European Mathematical Society and the Duke Mathematical Journal. His academic profile can be accessed at https://www.cmu.edu/math/people/faculty/bukh.html.

Boris Bukh is a mathematician specializing in combinatorics, discrete geometry, additive combinatorics, and discrepancy theory. His research explores the structure and properties of combinatorial objects, with a focus on extremal graph theory, set families, and geometric configurations. Bukh's work includes studies on the stability of equations in ion beam transport, forbidden subposets in set families, and bounds on the number of edges in graphs without even cycles. He also investigates random algebraic constructions, extremal graphs, and problems related to equiangular lines and spherical codes. His contributions span both theoretical and applied aspects of combinatorial mathematics.