科研之友
微信
新浪微博
Facebook
分享链接
摘要
The multiarrow formalism for coupled cell networks permits multiple arrows and self-loops. The Lifting Theorem states that any such network is a quotient of a network in which all arrows are single and self-loops do not occur. Previous proofs are inductive, and give no useful estimate of the minimal size of the lift. We give a noninductive proof of the Lifting Theorem, and identify the number of cells in the smallest possible lift. We interpret this construction in terms of the type matrix of the network, which encodes its topology and labeling.
- 出版日期2011-9
