The Library
An optimal lifting theorem for coupled cell networks
Tools
Stewart, Ian (2011) An optimal lifting theorem for coupled cell networks. International Journal of Bifurcation and Chaos, Vol.21 (No.9). pp. 2481-2487. doi:10.1142/S0218127411029872 ISSN 0218-1274.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1142/S0218127411029872
Abstract
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.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | International Journal of Bifurcation and Chaos | ||||
Publisher: | World Scientific Publishing Co. Pte. Ltd. | ||||
ISSN: | 0218-1274 | ||||
Official Date: | September 2011 | ||||
Dates: |
|
||||
Volume: | Vol.21 | ||||
Number: | No.9 | ||||
Page Range: | pp. 2481-2487 | ||||
DOI: | 10.1142/S0218127411029872 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |