Polynomial sequences of binomial-type arising in graph theory

zbMATH Open1300.05057arXiv1206.6174MaRDI QIDQ405133FDOQ405133

Authors: Jonathan Schneider 

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 $nimesn$ 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).

Full work available at URL: https://arxiv.org/abs/1206.6174

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 6957158
• Combinatorial chessboard tilings
• Rook Theory. II: Boards of Binomial Type
• Counting Tilings by Taking Walks in a Graph
• On a sequence of sparse binomial-type polynomials

zbMATH Keywords

chromatic polynomialbinomial type

Mathematics Subject Classification ID

Umbral calculus (05A40) Graph polynomials (05C31) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Cites Work

• Title not available (Why is that?)
• Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
• On the foundations of combinatorial theory. VIII: Finite operator calculus
• General structural results for Potts model partition functions on lattice strips
• Linked-cluster expansion of the graph-vertex coloration problem
• A new subgraph expansion for obtaining coloring polynomials for graphs
• The limit of chromatic polynomials

Cited In (10)

• Sequences of binomial type with persistent roots
• Genus polynomials of ladder-like sequences of graphs
• On a sequence of sparse binomial-type polynomials
• Sequences of binomial type with polynomial coefficients
• Binomial sequences
• On the operations of sequences in rings and binomial type sequences
• On generalized binomial series and strongly regular graphs
• Bivariate affine Gončarov polynomials
• Polynomials counting nowhere-zero chains in graphs
• Title not available (Why is that?)

This page was built for publication: Polynomial sequences of binomial-type arising in graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405133)