| Applied Combinatorics and Discrete Mathematics
Discrete mathematics, also called finite mathematics, is the study of fundamentally discrete mathematical structures, that is, structures that do not support or require the notion of continuity. Most of the objects studied in discrete mathematics are countable sets, such as the integers. Proof techniques and logic are also part of the discrete mathematics field.
Combinatorics is a branch of mathematics that studies finite collections of objects that satisfy specified criteria.
Studies particularly concern themselves with:
- Counting the objects in those collections.
- Deciding whether certain optimal objects exist.
- Algebraic structures that these objects have.
Current Projects
- Combinatorial Matrix Theory.
Faculty Researcher
Chjan Lim
Discrete Mathematics is also studied in Rensselaer’s Computer Science and Cognitive Science departments.
“In the 21st century, genomics, combinatorics, and their marriage with information technology, will impact the human condition as strongly as quantum science did in the 20th century.”
Rensselaer President Shirley Ann Jackson
|