{
  "id": "1103.6206",
  "version": "v1",
  "published": "2011-03-31T15:04:06.000Z",
  "updated": "2011-03-31T15:04:06.000Z",
  "title": "Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width",
  "authors": [
    "Shalosh B. Ekhad",
    "Jocelyn Quaintance",
    "Doron Zeilberger"
  ],
  "comment": "4 pages; Accompanied by Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/KamaTzviot . Sample input and output can be obtained from: http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/tzeva.html",
  "categories": [
    "math.CO"
  ],
  "abstract": "This short article, dedicated to our beloved guru Philippe FLAJOLET (1948-2011), is a case-study in computer-generated combinatorial research, where the computer, all by itself, is using the transfer-matrix method to derive (rigorously!) rational generating functions for chromatic polynomials for infinite sequences of graphs generalizing the action of taking the Cartesian product with a path of length n, n=1,2,... .",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-03-31T15:04:06.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "chromatic polynomials",
      "grid graphs",
      "automatic generation",
      "general creatures",
      "beloved guru philippe flajolet"
    ],
    "tags": [
      "research tool"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1103.6206E"
    }
  }
}