Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach

06/25/2019
by   Silvere Gangloff, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2020

Intensive use of computing resources for dominations in grids and other combinatorial problems

Our goal is to prove new results in graph theory and combinatorics thank...
research
05/24/2018

Eternal dominating sets on digraphs and orientations of graphs

We study the eternal dominating number and the m-eternal dominating numb...
research
03/11/2019

Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results

A tree with n vertices has at most 95^n/13 minimal dominating sets. The ...
research
04/14/2020

The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable

Monadic second order logic can be used to express many classical notions...
research
05/19/2020

Growth of bilinear maps

For a bilinear map *:ℝ^d×ℝ^d→ℝ^d of nonnegative coefficients and a vecto...
research
01/11/2021

Randomized weakly admissible meshes

A weakly admissible mesh (WAM) on a continuum real-valued domain is a se...
research
06/04/2020

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts

To monitor electrical activity throughout the power grid and mitigate ou...

Please sign up or login with your details

Forgot password? Click here to reset