A. Mia Heissan

A. Mia Heissan, Ph.D.

Associate Professor, Mathematics and Computer Science

Brownson Hall, Room 7
Monday 12:30-1:00PM & Thursday 10:30AM-1:00PM
a.heissan@mville.edu
1 (914) 323-7144

About Me

Mia Heissan has been a member of the Manhattanville Faculty since 2013. Dr. Heissan received her Ph.D. in Mathematics from the University of Rhode Island. Her research interests include graph theory and combinatorics, specifically graph representations, graph colorings, and combinatorial games. Graph theory is the study of mathematical objects (graphs) which consist of vertices (or nodes) connected by edges (or arcs.) If one wishes to examine a problem which entails a network of connected discrete structure, this is a graph theory problem. These problems frequently arise in computer science, and often graph theory is thought to be the theoretical math underlying computer science. It is only natural that Dr. Heissan also teaches not only in the mathematics program but in the computer science program as well. In her spare time, Mia enjoys playing competitive pickleball, hiking, camping, and cycling as well as spending time with her family in Connecticut, Rhode Island, and Missouri.

Current Courses
Mathematics for Liberal Arts (A and B)
Precalculus
Linear Algebra
Graph Theory
Calculus with Analytic Geometry - Early Transcendentals (I, II, and III)
Advanced Calculus (Real Analysis)
Fundamental Concepts
Probability
Animations and Game Design
Discrete Structures
Education
Philosophy, Bachelor Arts, Cornell University and Rockhurst College
Mathematics, Ph.D., University of Rhode Island
Feature Publications

Research Paper

On the Erdo-Sos Conjecture for graphs with diameter at most k+1

Congressus, Springer

Research Paper

On the Loebl-Komlos-Sos Conjecture and short caterpillars

Journal of Combinatorial Mathematics and Combinatorial Computing

Book

Separation of Gap Closures

Introduction to Closure Systems (Discrete Mathematics and Its Applications), 1st edition (2016), 264-271, ISBN-13: 978-1439819913

Book

On the Boundedness Character of the System xn+1 = (•1 + γ1yn) / xn and yn+1 = (•2 + β2xn + γ2yn) / (A2 + xn + yn)

Communications in Mathematical Analysis 7 no. 2 (2009) 41-50, ISSN 1938-9787