On limit cycles of monotone functions with symmetric connection graph

被引：31

作者：

Aracena, J

Demongeot, J

Goles, E

机构：

[1] Univ Chile, Dept Ingn Matemat, Ctr Modelamiento Matemat, Santiago, Chile

[2] UJF, IMAG, TIMC, Fac Med, F-38706 La Tronche, France

来源：

THEORETICAL COMPUTER SCIENCE | 2004年 / 322卷 / 02期

关键词：

monotone function; discrete network; graph;

D O I：

10.1016/j.tcs.2004.03.010

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the length of the limit cycles of discrete monotone functions with symmetric connection graph. We construct a family of monotone functions such that the limit cycles are of maximum possible length, which is exponential in the number of variables. Furthermore, we prove for the class of monotone functions with more than two states and connection graph equal to a caterpillar that the length of the limit cycles is at most two. Finally, we give some exclusion results in arbitrary trees. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：237 / 244

页数：8

共 8 条

[1]

[Anonymous], 1993, ORIGINS ORDER SELF O

[2] Counting and classifying attractors in high dimensional dynamical systems [J].