Abstract
Double commutative-step digraph generalizes the double-loop digraph. A double commutative-step digraph can be represented by an L-shaped tile, which periodically tessellates the plane. Given an initial tile L(l, h, x, y), Aguiló et al. define a discrete iteration L(p) = L(l + 2p, h + 2p, x + p, y + p), p = 0, 1, 2, …, over L-shapes (equivalently over double commutative-step digraphs), and obtain an orbit generated by L(l, h, x, y), which is said to be a procreating k-tight tile if L(p)(p = 0, 1, 2, …) are all k-tight tiles. They classify the set of L-shaped tiles by its behavior under the above-mentioned discrete dynamics and obtain some procreating tiles of double commutative-step digraphs. In this work, with an approach proposed by Li and Xu et al., we define some new discrete iteration over L-shapes and classify the set of tiles by the procreating condition. We also propose some approaches to find infinite families of realizable k-tight tiles starting from any realizable k-tight L-shaped tile L(l, h, x, y), 0 ≤ |y − x| ≤ 2k + 2. As an example, we present an infinite family of 3-tight optimal double-loop networks to illustrate our approaches.
Similar content being viewed by others
References
Aguiló, F., Diego, I. Discrete dynamics over double commutative-step diagraphs. Discrete Mathematics, 231: 57–72 (2001)
Aguiló, F., Fiol, M.A. An efficient algorithm to find optimal double loop networks. Discrete Mathematics, 138: 15–29 (1995)
Bermond, J.C., Comellas, F., Hsu, D.F. Distributed loop computer networks: a survey. J. Parallel Distribut. Comput., 24: 2–10 (1995)
Chan, C.F., Chen, C., Hong, Z.X. A simple algorithm to find the steps of double-loop networks. Discrete Applied Mathematics, 121: 61–72 (2002)
Erdö, P., Hsu, D.F. Distributed loop networks with minimum transmission delay. Theoret. Comput. Sci., 100: 223–241 (1992)
Esqué, P., Aguiló, F., Fiol, M.A. Double commutative-step digraphs with minimum diameters. Discrete Mathematics, 114: 147–157 (1993)
Fiol, M.A., Yebra, J.L.A., Alegre, I., Valero, M. A discrete optimization problem in local networks and data alignment. IEEE Trans. Comput., C36: 702–713 (1987)
Hwang, F.K. A complementary survey on double-loop networks. Theoret. Comput. Sci., 263: 211–229 (2001)
Li, Q., Xu, J., Zhang, Z. The infinite families of optimal double loop networks. Discrete Applied Mathematics, 46: 179–183 (1993)
Wong, C.K., Coppersmith, D. A combinatorial problem related to multimode memory organizations. J. Ass. Comput. Mach., 21: 392–402 (1974)
Xu, J., Liu, Q. An infinite family of 4-tight optimal double loop networks. Science in China (Series A), A46(1): 139–143 (2003)
Zhou, J., Xu, X. On infinite families of optimal double-loop networks with non-unit steps. Ars Combinatoria, accepted.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 60473142) and Natural Science Foundation of Anhui Education Bureau of China (No. ZD2008005-1).
Rights and permissions
About this article
Cite this article
Zhou, Jq. Procreating tiles of double commutative-step digraphs. Acta Math. Appl. Sin. Engl. Ser. 24, 185–194 (2008). https://doi.org/10.1007/s10255-004-4102-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-004-4102-y