Professor Jason Williford

Jason Williford, Ph.D., University of Delaware Department Head Professor of Mathematics Ross Hall 314 jwillif1@uwyo.edu | +1-307-766-2209 Research interests: Finite geometry, Graph theory, and Association schemes

Education

Ph.D. Mathematics, University of Delaware, 2004
B.A. Mathematics, University of Pennsylvania, 1998

About Dr. Williford

Jason Williford joined the University of Wyoming faculty in 2009. He came to the University of Wyoming from the University of Colorado at Denver.

His mathematical interests center around the interplay between algebra, finite geometry, and combinatorics. Association schemes and coherent configurations are generalizations of permutation groups that provide a framework in which this interplay is quite rich. Recently, he has focused on generalizing the necessary conditions for existence and subset bounds of association schemes to coherent configurations. He also studies extremal problems in graph theory that can be approached using constructions from finite fields and geometries.

Representative publications

• Jacques Verstraete, Jason Williford, 2019, “Graphs Without Theta Subgraphs”, Journal of Combintatorial Theory, Series B 134, pp 76-87.
• Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song, Jason Williford, 2017, “On the Wiener index, distance cospectrality and transmission regular graphs”, Discrete Applied Mathematics 230, 1-10.
• Sylvia Hobart, Jason Williford, 2017, “New feasibility conditions for directed strongly regular graphs”, Electronic Journal of Combinatorics 24.
• G. Eric Moorhouse, Shuying Sun, Jason Williford, 2017, “The Eigenvalues of the Graphs D(4, q)”, Journal of Combintatorial Theory, Series B 125, 1-20.
• G. Eric Moorhouse, Jason Williford, 2016, “Double Covers of Symplectic Dual Polar Space Graphs”, Discrete Mathematics 339, 571-588.