Polynomial sequences of binomial-type arising in graph theory
The electronic journal of combinatorics, Tome 21 (2014) no. 1
In this paper, we show that the solution to a large class of "tiling'' problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$ toroidal chessboard such that no two polyominos overlap is eventually a polynomial in $n$, and that certain sets of these polynomials satisfy binomial-type recurrences. We exhibit generalizations of this theorem to higher dimensions and other lattices. Finally, we apply the techniques developed in this paper to resolve an open question about the structure of coefficients of chromatic polynomials of certain grid graphs (namely that they also satisfy a binomial-type recurrence).
DOI :
10.37236/3702
Classification :
05B45, 05B50, 05C31, 05A40
Mots-clés : chromatic polynomial, binomial type
Mots-clés : chromatic polynomial, binomial type
Affiliations des auteurs :
Jonathan Schneider 1
@article{10_37236_3702,
author = {Jonathan Schneider},
title = {Polynomial sequences of binomial-type arising in graph theory},
journal = {The electronic journal of combinatorics},
year = {2014},
volume = {21},
number = {1},
doi = {10.37236/3702},
zbl = {1300.05057},
url = {http://geodesic.mathdoc.fr/articles/10.37236/3702/}
}
Jonathan Schneider. Polynomial sequences of binomial-type arising in graph theory. The electronic journal of combinatorics, Tome 21 (2014) no. 1. doi: 10.37236/3702
Cité par Sources :