Shahla Nasserasr Headshot

Shahla Nasserasr

Assistant Professor

School of Mathematical Sciences
College of Science

585-475-5150
Office Location

Shahla Nasserasr

Assistant Professor

School of Mathematical Sciences
College of Science

585-475-5150

Select Scholarship

Journal Paper
Adm, M., et al. "Weakly Hadamard Diagonalizable Graphs." Linear Algebra and Its Applications 610. (2021): 86 -- 119. Web.

Currently Teaching

MATH-200
3 Credits
This course prepares students for professions that use mathematics in daily practice, and for mathematics courses beyond the introductory level where it is essential to communicate effectively in the language of mathematics. It covers various methods of mathematical proof, starting with basic techniques in propositional and predicate calculus and set theory, and then moving to applications in advanced mathematics.
MATH-241
3 Credits
This course is an introduction to the basic concepts of linear algebra, and techniques of matrix manipulation. Topics include linear transformations, Gaussian elimination, matrix arithmetic, determinants, vector spaces, linear independence, basis, null space, row space, and column space of a matrix, eigenvalues, eigenvectors, change of basis, similarity and diagonalization. Various applications are studied throughout the course.
MATH-351
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-495
1 - 3 Credits
This course is a faculty-directed project that could be considered original in nature. The level of work is appropriate for students in their final two years of undergraduate study.
MATH-645
3 Credits
This course introduces the fundamental concepts of graph theory. Topics to be studied include graph isomorphism, trees, network flows, connectivity in graphs, matchings, graph colorings, and planar graphs. Applications such as traffic routing and scheduling problems will be considered.
MATH-646
3 Credits
This course introduces the fundamental concepts of combinatorics. Topics to be studied include counting techniques, binomial coefficients, generating functions, partitions, the inclusion-exclusion principle and partition theory.
MATH-689
1 - 4 Credits
Special Topics courses cover content that is not represented in the main curriculum on an experimental or trial basis.
MATH-799
1 - 3 Credits
Independent Study