Add to ORKG19 pages, 11 figures v2 corrects a about the entropy and the growth rate (they are not equal: one is the log of the other)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
We consider discrete-time homogeneous systems under arbitrary switching and study their growth rate,...
The fast dynamo growth rate for a C k+1 map or flow is bounded above by topological entropy plus a...
Rule k (k=1,2,3,...) is a well known family of approximation algorithms that can be used to find con...
19 pages, 11 figures v2 corrects a about the entropy and the growth rate (they are not equal: one is...
We outline the most recent theory for the computation of the exponential growth rate of the number o...
Geometric grid classes of permutations have proven to be key in investigations of classical permutat...
In this paper we investigate the growth rate of the number of all possible paths in graphs with resp...
Isotropic growth from a single point on a two-dimensional square grid should generate an increasing ...
International audienceWe study the asymptotic number of certain monotonically labeled increasing tre...
"We study the size of products of matrices taken from a finite set of matrices. In particular we des...
We initiate the study of general neighborhood growth dynamics on two dimensional Hamming gr...
The fast dynamo growth rate for a C k map or ow is bounded above by topo logical entropy plus a k co...
AbstractA tessellation is taken to be an infinite, 1-ended, 3-connected, locally finite, and locally...
The domination number for grid graphs has been a long studied problem; the first results appeared ov...
Abstract. We introduce a new method for estimating the growth of various quantities arising in dynam...
We consider discrete-time homogeneous systems under arbitrary switching and study their growth rate,...
The fast dynamo growth rate for a C k+1 map or flow is bounded above by topological entropy plus a...
Rule k (k=1,2,3,...) is a well known family of approximation algorithms that can be used to find con...
19 pages, 11 figures v2 corrects a about the entropy and the growth rate (they are not equal: one is...
We outline the most recent theory for the computation of the exponential growth rate of the number o...
Geometric grid classes of permutations have proven to be key in investigations of classical permutat...
In this paper we investigate the growth rate of the number of all possible paths in graphs with resp...
Isotropic growth from a single point on a two-dimensional square grid should generate an increasing ...
International audienceWe study the asymptotic number of certain monotonically labeled increasing tre...
"We study the size of products of matrices taken from a finite set of matrices. In particular we des...
We initiate the study of general neighborhood growth dynamics on two dimensional Hamming gr...
The fast dynamo growth rate for a C k map or ow is bounded above by topo logical entropy plus a k co...
AbstractA tessellation is taken to be an infinite, 1-ended, 3-connected, locally finite, and locally...
The domination number for grid graphs has been a long studied problem; the first results appeared ov...
Abstract. We introduce a new method for estimating the growth of various quantities arising in dynam...
We consider discrete-time homogeneous systems under arbitrary switching and study their growth rate,...
The fast dynamo growth rate for a C k+1 map or flow is bounded above by topological entropy plus a...
Rule k (k=1,2,3,...) is a well known family of approximation algorithms that can be used to find con...