Seth Nelson
About Me
I’m a PhD student in mathematics with an amorphous collection of interests, focusing loosely on representation theory, combinatorics, and computational mathematics. Currently, when I’m not thinking about what research direction I should pursue, I think about graph automorphisms, and different computational problems in discovering graph automorphisms.
Research
-
Strong chromatic index of planar graphs with Ore-degree at most 7 is at most 13 (with Gexin Yu) [arxiv]
We use Combinatorial Nullstellens and Euler’s Polyhedron Formula to prove the above result.
-
Character theoretic techniques for nonabelian partial difference sets (with Eric Swartz) [arxiv]
We extend some theoretical results from previous work by Udo Ott, and we develop further techniques to use character theory to analyze the conjugacy class intersections of partial difference sets inside nonabelian groups. We created an algorithm for finding the conjugacy class intersections of certain classes of partial difference set.
Teaching
I’ve helped grade, TA, or lecture in the following courses:
- University of Georgia, Math 3200 (Fall 2025): Intro to Higher Mathematics
- William & Mary, Math 307 (Fall 2024): Abstract Algebra I
- William & Mary, Math 451 (Fall 2024): Linear Algebra Methods in Combinatorics
Contact
If you’d like to reach out about research, collaboration, or teaching, feel free to email me at srnelson.math@gmail.com.