Jake Wildstrom's Research

• Current research
• Writings
• Presentations
• Tools I designed
• Resources

Current Research

I'm working currently on a problem known as the dynamic location problem, which deals with the ability to optimally relocate mobile servers on a graph in real-time in response to service requests on a graph. This exploration is drawing not only from traditional combinatorial-optimization methods and results, but also placing the problem in a framework drawn from control theory.

More information on my current research can be found in my research statement (PDF, Postscript).

Writings

• Cost thresholds for dynamic resource location (PDF, PS)
• The Sierpinski Variations (in preparation)

Presentations

• Cost Thresholds for Dynamic Resource Location, Mathfest 2006.
• Look for Mathematical Properties of Hexaflexagons, Mathfest 2006 (joint work with Susan Wildstrom)
• The Sierpinski Variations: Self-Similar Crochet, Joint Mathematics Meetings 2005.

Tools I Designed

I'm currently in the process of organizing software I've written to explore dynamic location problems. Hopefully, I can get them in a state to share with the world soon.

Resources

• Fan Chung's website: all of her (many, mostly on graph theory) papers are here, as well as some demonstrations. As a graph-theory enthusiast, I find it a treasure-trove.
• Collected papers from Van Vu's combinatorics seminar in March 2005, which I maintain for archival purposes.
• The American Mathematical Society is America's largest research-oriented mathematics organization. They've got a literature search (subscription, but most universities have a site-subscription), meetings schedules, and many other resources useful to the research mathematician.
• MathSciNet, the aforementioned AMS literature-search utility.
• Google Scholar is non-math-specific, and in some ways less flexible than the MathSciNet search, but is still a very good way to search through published literature.