Derek Young's research is in combinatorial matrix theory. Young uses linear algebra and mathematical software to construct matrices that realize the maximum nullity over a set of matrices. Young also uses graph theory to describe the maximum nullity. For instance, each set of matrices that are of interest corresponds to a unique graph. That graph has parameters which bound the maximum nullity above and below.
Areas of Expertise
Combinatorics, linear algebra
- Ph.D., B.S., Iowa State University