My dissertation topic has nothing to do with the We Are Blog paper that I’ll be writing. It is, instead, about a GraphTheory related problem - given the number of vertices and the number of edges, construct a graph that has the greatest number of possible spanning trees. Maybe I’ll provide a more lengthy and detailed explanation in another post.
For my work, I use a lot of different fields of Mathematics. My advisor wants me to create a website with a summary of my results as well as an interactive component that implements my conjecture that covers a huge number of subcases (and all of the particular subcase that is my specific topic). That website isn’t ready to go prime-time yet, but hopefully will be in the next few days. When it is, I intend to make an announcement here. It will be a rather different sort of site than what you see here - a lot less bells and whistles, etc…. If it is lacking in something, sometimes I may augment it by linking it to something here - otherwise I may remedy it by implementing something there, or stuff like that.