### Jeremy L. Martin Source Code and Data Archive

This is my master page for publicly available source code and data (in Maple, Macaulay2, Sage, C, ...) for some of my research projects. This code may be used freely for any noncommercial purpose.

#### Material related to the article "On the spectra of simplicial rook graphs"

• Sage worksheet to construct simplicial rook graphs and compute their spectra

#### Material related to the article "On distinguishing trees by their chromatic symmetric functions"

• Computing the chromatic symmetric function in Maple
• Lists of all trees up to isomorphism. Reading the file Trees1-11 into a Maple session defines a global variable TREES and sets it to equal a list of 11 lists of sets. Each set in TREES[n] consists of n-1 ordered pairs of integers in the range 1..n, regarded as edges of a graph on [n]. For every tree T on n vertices, there is exactly one set in TREES[n] that defines a tree isomorphic to T. This list is enough for a lot of computations; however, if you want more, you can read in the files Trees12, Trees13, Trees14, Trees15, Trees16 (in that order!), each of which appends to TREES a list of trees on the indicated number of vertices.
Note: I did not construct this data, but merely translated into Maple the database of trees created by S. Piec, K. Malarz, and K. Kulakowski as described in their preprint "How to count trees?", arXiv:cond-mat/0501594.
• Computational verification of Conjectures 6 and 7 (which assert that a certain symmetric function is h-positive and almost h-integral). This is a Maple worksheet that uses John Stembridge's freely available SF package. I was able to confirm both conjectures for all n≤20 before my computer ran out of memory.