Professor Jason Williford
Department of Mathematics and Statistics
Professor of Mathematics
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. He studies Q-polynomial association schemes, sets of vectors satsifying the balanced set condition of Terwilliger, Turan type problems, and using computers and the software Magma to search for combinatorial objects with desired properties.
Representative publications
-
Philip DeOrsey, Stephen G. Hartke, Jason Williford, 2022, "A classification of hyperfocused 12-arcs", Graphs and Combinatorics 38.
-
Alexander L.Gavrilyuk, Janoš Vidali, Jason Williford, 2021, "On few-class Q-polynomial association schemes: feasible parameters and nonexistence results",
Ars Mathematica Contemporanea 20, pp 103–127.
- Jacques Verstraete, Jason Williford, 2019, “Graphs Without Theta Subgraphs”, Journal of Combintatorial Theory, Series B 134, pp 76-87.
- 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, pp 1-20.
- Eric Moorhouse, Jason Williford, 2016, “Double Covers of Symplectic Dual Polar Space Graphs”, Discrete Mathematics 339, pp 571-588.
