Combinatorics and discrete mathematics constitute the study of finite or countable structures and the algorithms that govern them. At its heart is enumeration: the art of counting arrangements, ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

Organized by: Joshua Cooper (cooper@math.sc.edu), Alec Helm (ah191@email.sc.edu), and Isaiah Hollars (isaiah.hollars@sc.edu) This page will be updated as new seminars are scheduled. Make sure to check ...

Algebra is the discipline of pure mathematics that is concerned with the study of the abstract properties of a set, once this is endowed with one or more operations that respect certain rules (axioms) ...

The notion of hypergeometric numbers arises from the extension of classical sequences, such as Bernoulli, Cauchy and Euler numbers, via hypergeometric functions. At its core is the representation of ...

Dr. Coppenbarger received a BS in Math and Physics at the University of Arizona before going to the University of Rochester to earn a Ph.D. in Mathematics studying quantum mechanics on graphs. He has ...

You’ll have the chance to produce work that makes an original contribution to the field of mathematics and its applications. You have a wide range of topics to choose from, including combinatorics, ...

A new computer program fashioned after artificial intelligence systems like AlphaGo has solved several open problems in combinatorics and graph theory. “I was very happy to have the question answered.

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...