Professor Jayawant specializes in Discrete Mathematics (Enumerative combinatorics, graph theory) and Mathematics Education.
Pallavi Jayawant’s mathematical interest is in combinatorial proofs of statements and identities through the use of discrete objects (such as tilings, graphs and triangulations) as models. Combinatorial proofs are usually more constructive in nature and help interpret identities described with symbols. Her recent work has involved Chebyshev polynomials and Dyson’s theorem about continuous functions on spheres. Small-world networks, spanning trees, and partitions are of recent interest as well and have figured prominently in work with students.