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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
