Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach
Discrete Mathematics
2019-08-13 v2 Combinatorics
Abstract
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants, an algorithm which computes the growth rate. We also give bounds on these rates provided by a computer program.
Cite
@article{arxiv.1906.10779,
title = {Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach},
author = {Silvère Gangloff and Alexandre Talon},
journal= {arXiv preprint arXiv:1906.10779},
year = {2019}
}
Comments
19 pages, 11 figures v2 corrects a about the entropy and the growth rate (they are not equal: one is the log of the other)