Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width

Details Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width

2011-03-31

arxiv.org/abs/1103.6206v1

Mathematics

Combinatorics

4 pages; Accompanied by Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/KamaTzviot . Sample input and output ca

Scientific paper

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,... .

Affiliated with

Also associated with

No associations

Rating

Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-245679