Nathan Lindzey

Nathan Lindzey is an Assistant Professor in the Department of Mathematical Sciences at the University of Memphis. His research focuses on algebraic combinatorics, graph theory, and discrete mathematics, with particular emphasis on extremal combinatorics, permutation patterns, and computational complexity. He has published extensively on topics such as intersecting families of spanning trees, derangement graphs, and applications of algebraic methods in combinatorial optimization.

Dr. Lindzey's work bridges theoretical foundations and practical applications, including studies on association schemes, semidefinite optimization, and harmonic polynomials. His recent articles address challenges in graph theory, coding theory, and algorithm analysis, reflecting a commitment to advancing interdisciplinary approaches in discrete mathematics.

His research trends highlight contributions to understanding extremal problems in combinatorics, leveraging algebraic tools and computational techniques. Though no awards are explicitly listed, his prolific publication record underscores his active role in the academic community.

Dr. Lindzey advises no listed students and has no documented grants in the provided text. He is affiliated with the University of Memphis' Mathematical Sciences department, contributing to both teaching and research initiatives in the field.