Article thumbnail
Location of Repository

An optimal lifting theorem for coupled cell networks

By Ian Stewart

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

Topics: QA
Publisher: World Scientific Publishing Co. Pte. Ltd.
Year: 2011
DOI identifier: 10.1142/s0218127411029872
OAI identifier: oai:wrap.warwick.ac.uk:40444
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1142/S021... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.