The Computational Combinatorics blog is edited by Derrick Stolee.

I define “computational combinatorics” as the use of algorithms and computers to assist in the discovery and proof of combinatorial theorems. Hence, the problems we investigate and inherently combinatorial, but the tools we discuss are very computational.

I plan on having a few different types of posts on this blog:

  • Introduction to a Computational Technique. These posts will highlight a specific computational technique and discuss how to use the technique as well as previous uses.
  • Description of Computational Results. When a new result in combinatorics is published (or made available online) a post will present a high-level description of the results and techniques used in the paper. I plan to write such a post for each of my computational combinatorics papers, but I will also write about other papers I read. If you have a computational combinatorics result that you would like to share, please contact me about writing a guest post (you can also contact me about writing a guest post for any other type of post as well). I may also pull an older paper off the shelf to discuss.
  • Tips and Tricks. Not all computational techniques are substantial enough to be included in a final research paper, but these tools should be shared. Typically, these will be short examples of using Sage or other software tools to discover new examples of combinatorial objects.
  • Roundups. Every month, I’ll include a list of papers, blog posts, and news articles about computational combinatorics and include a little blurb based on a short reading.

As the blog develops, other types of posts will be discovered, such as announcements and roundups.

I plan to write a post every two weeks, and hope to write a post every week.