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, ...

Combinatorial structures such as set systems, hypergraphs and families of finite objects form a unifying framework for extremal problems that probe how local intersection constraints govern global ...

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 ...

Taken concurrently with EGR/MAT/PHY 191. An integrated course that covers the material of PHY 103 and MAT 201 with the emphasis on applications to engineering. Math topics include: vector calculus; ...

Mathematical truths are often born of the conflict between order and disorder. Mathematicians discover patterns, and, to better understand the mysterious forces at play, they look for countervailing ...

A new approach has chipped away at a famously unsolved math problem. The Erdos-Turan conjecture in additive combinatorics is one of the longest lasting unsolved problems. The two mathematicians used ...

Virtually every sector of employment seeks highly skilled mathematicians —from academia to commerce, finance, and health sciences, to government labs and national security, as well as STEM fields.

The Drexel doctoral (PhD) in Mathematics program emphasizes original research and scholarly contribution. Students must pass a qualifying exam after their first year and typically complete the program ...