Hossein Shahmohamad
Professor
School of Mathematics and Statistics
College of Science
Minors Coordinator, Mathematics
585-475-7564
Office Hours
Tu Th 10 am -11 am and by appointment
Office Location
Hossein Shahmohamad
Professor
School of Mathematics and Statistics
College of Science
Minors Coordinator, Mathematics
Education
BS, MA, California State University at Long Beach; Ph.D., University of Pittsburgh
585-475-7564
Areas of Expertise
combinatorics
graph theory
discrete mathematics
Currently Teaching
MATH-190
Discrete Mathematics for Computing
3 Credits
This course introduces students to ideas and techniques from discrete mathematics that are widely used in Computer Science. Students will learn about the fundamentals of propositional and predicate calculus, set theory, relations, recursive structures and counting. This course will help increase students’ mathematical sophistication and their ability to handle abstract problems.
MATH-231
Differential Equations
3 Credits
This course is an introduction to the study of ordinary differential equations and their applications. Topics include solutions to first order equations and linear second order equations, method of undetermined coefficients, variation of parameters, linear independence and the Wronskian, vibrating systems, and Laplace transforms.
MATH-341
Advanced Linear Algebra
3 Credits
This is a second course in linear algebra that provides an in-depth study of fundamental concepts of the subject. It focuses largely on the effect that a choice of basis has on our understanding of and ability to solve problems with linear operators. Topics include linear transformations, similarity, inner products and orthogonality, QR factorization, singular value decomposition, and the Spectral Theorem. The course includes both computational techniques and the further development of mathematical reasoning skills.
MATH-351
Graph Theory
3 Credits
This course covers the theory of graphs and networks for both directed and undirected graphs. Topics include graph isomorphism, Eulerian and Hamiltonian graphs, matching, covers, connectivity, coloring, and planarity. There is an emphasis on applications to real world problems and on graph algorithms such as those for spanning trees, shortest paths, and network flows.
MATH-361
Combinatorics
3 Credits
This course introduces the mathematical theory of enumeration of discrete structures. Topics include enumeration, combinatorial proofs, recursion, inclusion-exclusion, and generating functions.