Discrete Math
Sebastian Cioaba Assistant Professor Graph Theory
Robert Coulter Associate Professor Finite Fields, Non-Associative Algebras and Designs
Gary Ebert Professor Finite Geometry and Combinatorics
Felix Lazebnik Professor Graph Theory and Combinatorics
Qing Xiang Professor Combinatorial Design Theory and Algebraic Coding Theory
Current and Previous Phd Students
Owen Byer Completed 1996 Eastern Menonite University
Maria Capursi Completed 2006 University of Central Florida
David Chandler Completed 2004
Craig Culbert Completed 2009 Franklin and Marshall College
Vasyl Dmytrenko Completed 2004 Temple University
Jeremy Dover Completed 1996 White Cliffs Consulting
Frank Fiedler Completed 2004 Wesley College
Gene Fiorini Completed 1993 Shippensburg University
Todd Gutekunst Completed 2008 King's College
Pamela Kosick current University of Delaware
Keith Mellinger Completed 2001 University of Mary Washington
Sven Reichard Completed 2003
Ray Viglione Completed 2002 Kean University
Zeying Wang Completed 2008 Ohio University
Kenny Wantz Completed 1995 Southern Nazarene University
Richard Weida Completed 1987 Lycoming College
Jason Williford Completed 2004 University of Colorado (Denver)
Junhua Wu Completed 2008 Worcester Polytechnic Institute


Every member of the Discrete Mathematics group is actively engaged in research; for more specific information concerning the research activities of any particular member, please visit that individual's home page. Approaches to conduct suitable collaborative work are welcome. All members of the group are interested in working with and advising graduate students of suitable standard. Should you be considering working with any of the members, you are encouraged to approach the member to discuss the matter as soon as is practicable. For those students who are US citizens and interested in employment with a government agency, the National Security Agency is about one hour's drive away from campus and is one of the world's largest employers of discrete mathematicians.

The Weekly Seminar

There is a weekly Discrete Mathematics seminar, given by local faculty and students, as well as external visitors. In most cases, the weekly seminar runs on Friday afternoons, 4 to 5, with continuing discussions usually occurring at a local watering hole such as the Deer Park Tavern. You can view the current schedule here. If you have any questions concerning the seminars or would like to present a talk here at UD in the seminar series, please feel free to contact the seminar coordinator.

The Graduate Program

The Graduate Program in Mathematics includes a number of courses that are relevant to discrete mathematics:

MATH-650 Abstract Algebra Offered every Spring Elementary number theory, polynomial and abstract rings, ideals and quotient rings, PID's and Eclidean rings, groups, cyclic and Abelian groups, direct products, algebraic field extensions, splitting fields, field automorphisms, finite fields. (Prerequisite: Undergraduate abstract algebra.)
MATH-688 Combinatorics and Graph Theory I Offered every Spring Combinatorial enumeration, designs and geometries, graphs, set systems, partially ordered sets, existence and construction of various combinatorial objects, Ramsey theory. (Prerequisite: MATH-650 or permission from instructor)
MATH-689 Combinatorics and Graph Theory II Offered every Fall Methods of linear algebra in combinatorics and graph theory, basics of coding theory and associated designs, number theory and cryptography, communication complexity. (Prerequisite: Knowledge of linear algebra)
MATH-826 Topics in Pure Mathematics Offered every year or two Topics vary from year to year and will be chosen from a variety of areas in pure mathematics (not necessarily discrete mathematics). The course is commonly, though not always, closely aligned to the research interests of the lecturer. (Prerequisite: Permission of instructor)
MATH-845 Groups and their Applications Offered alternate Falls Review of elementary group theory, permutation groups, group actions, Sylow theorems, semi-direct and wreath products, classical matrix groups, automorphism groups of combinatorial structures, Polya enumeration. May also include representation theory, free groups, finite groups of isometries of Euclidean spaces. (Prerequisite: MATH-650 or permission of instructor)
MATH-870 Reading in Mathematics Offered when appropriate A student or students who wish to study an area of mathematics which is not offered in a regular course but is closely aligned to a faculty member's areas of expertise can approach that faculty member about taking a reading course. In such cases, the work load and availability of the faculty member may or may not allow the proposed course to proceed. (Prerequisite: Permission of instructor)

©2004, Department of Mathematical Sciences
Last modified by Robert Coulter