Discrete Mathematics

Discrete Mathematics is the study of structures which are fundamentally discrete rather than continuous. While many famous results in discrete mathematics pre-date the invention of the digital computer, the field has exploded in our digital age. Computers store data in discrete bits and operate in discrete steps. Discrete Mathematics includes the investigation of all structures and algorithms appropriate for the representation and storage of data. The Internet, for instance, can be usefully represented as a graph, a fundamental object of this discipline.

Discrete Mathematics includes, among others sub-fields, Graph Theory, Combinatorics, Coding Theory, Cryptography, Game Theory, Computational Complexity, and Combinatorial Optimization. It makes useful and fascinating connections with fields like Group Theory, Matrix Theory, and Linear Programming. It includes the most important unsolved problem in mathematics, the question of whether P = NP. And investigations in many fields, for instance Number Theory, combine both discrete and continuous tools.

VCU’s Discrete Mathematics group consists of Ghidewon Abay-Asmerom, Moa Apagodu, Danail Bonchev, Daniel Cranston, Richard Hammack, Glenn Hurlbert, Craig Larson, and Dewey Taylor (from Mathematics), and Jose Dula (Production and Operations Management). This group runs a weekly Discrete Mathematics Seminar.

Discrete Mathematics Faculty

Ghidewon Abay-Asmerom, Ph.D.Associate Professorgabayasm@vcu.edu804.828.6240
Moa Apagodu, Ph.D.Associate Professormapagodu@vcu.edu
Neal Bushaw, Ph.D.Assistant Professornobushaw@vcu.edu
David Chan, Ph.D.Associate Professordmchan@vcu.edu
Richard Hammack, Ph.D.Professorrhammack@vcu.edu804.828.6237
Glenn Hurlbert, Ph.D.Department Chair, Professorghurlbert@vcu.edu804.828.3523
Craig Larson, Ph.D.Professorclarson@vcu.edu
Allison Moore, Ph.D.Assistant Professormoorea14@vcu.edu
Dewey Taylor, Ph.D.Associate Professordttaylor2@vcu.edu804.828.5569
View graphic versionView graphic version