UNSPECIFIED (1994) PERMISSIBLE SYMMETRIES OF COUPLED CELL NETWORKS. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 116 (Part 1). pp. 27-36.

Full text not available from this repository, contact author.

Request Changes to record.

Abstract

We consider coupled sets of identical cells and address the problem of which symmetries are permissible in such networks. For example, n linearly coupled cells with one independent variable in each cell cannot be constructed with the symmetry group A(n), the alternating group on n symbols. Using a graphical technique, we show that it is possible to construct cell networks with any desired finite group of symmetries. In particular, we show that any subgroup of S(n) can be realized as the symmetries of a group of n cells. Special forms of coupling (especially low order polynomial coupling) are shown to restrict the possible symmetries. We give some upper and lower bounds for the degree of polynomial required to realize several classes of subgroups of S(n).

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Journal or Publication Title:	MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY
Publisher:	CAMBRIDGE UNIV PRESS
ISSN:	0305-0041
Official Date:	July 1994
Dates:	Date Event July 1994 UNSPECIFIED
Volume:	116
Number:	Part 1
Number of Pages:	10
Page Range:	pp. 27-36
Publication Status:	Published

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