Combinatorics and Discrete Mathematics

The members of the research group in Combinatorics and Discrete Mathematics (CDM, for short) conduct research in the areas of graph theory, algebraic combinatorics, discrete geometry, combinatorial optimization and other fields of discrete mathematics.

A seminar in Algebraic Combinatorics is working since Fall 1995 with a special emphasis on promoting students’ interests in CDM.

The CDM group includes people whose interests permanently lie in the area as well as those whose combinatorial activities are sporadic.

Group Members

Name
Email
Research Interests
Courses
Emeritus Prof Amos Altshuler

Combinatorial geometry, topological graph theory, convex polytopes

Prof. Daniel Berend

Applied Probability, Combinatorial Optimization, Number Theory.

Prof. Menachem Kojman

Set theory, mathematical logic, combinatorics.

Prof. Michael Klin

Finite permutation groups, algebraic combinatorics, graph theory, mathematical chemistry

Prof. Shakhar Smorodinsky

Computational and combinatorial geometry, sensor and wireless networks, online algorithms, discrete math.

Discrete Mathematics for Communication Engineering
Emeritus Prof Yoav Segev

Finite group theory, finite geometries, combinatorial topology.

Dr. Izhar Oppenheim

Geometric Group theory, Expander graphs and High Dimensional Expanders, Coarse geometry

Introduction to Analysis and Expander graphs and expansion in groups
Dr. Inna Entova-Aizenbud

Representation Theory: Lie algebras and superalgebras, representations of finite groups, tensor categories, representation stability, diagram categories, categorical actions

Dr. Yaar Solomon

Discrete Geometry, Combinatorics, Dynamical Systems, Ergodic Theory, Diophantine Approximations, Computational Geometry

Discrete Mathematics