Concatenation arguments and their applications to polyominoes and polycubes

被引：3
|
作者：
Barequet, Gill [1 ]
Ben-Shachar, Gil [1 ]
Osegueda, Martha Carolina [2 ]
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-3200003 Haifa, Israel
[2] Univ Calif Irvine, Dept Comp Sci, Irvine, CA 92717 USA
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2021年 / 98卷
基金：
美国国家科学基金会;
关键词：
Lattice animals; Growth constant; Asymptotic analysis; LATTICE ANIMALS; GROWTH CONSTANT;
D O I：
10.1016/j.comgeo.2021.101790
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we develop a method for setting lower and upper bounds on growth constants of polyominoes and polycubes whose enumerating sequences are so-called quasi sub-or super-multiplicative. The method is based on concatenation arguments, applied directly or recursively. Inter alia, we demonstrate the method on general polycubes, tree polyominoes and polycubes, and convex polyominoes. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数：12
相关论文
共 50 条
12345