Testing for Sn-Symmetry with a Recursive Detective
Please always quote using this URN: urn:nbn:de:0297-zib-1786
- In the recent years symmetric chaos has been studied intensively. One knows which symmetries are admissible as the symmetry of an attractor and which transitions are possible. The numeric has been developed using equivariant functions for detection of symmetry and augmented systems for determination of transition points. In this paper we look at this from a sophisticated group theoretic point of view and from the view of scientific computing, i.e. efficient evaluation of detectives is an important point. The constructed detectives are based on Young's seminormal form for $S_n$. An application completes the paper.
Download full text files
Additional Services
| Author: | Karin Gatermann |
|---|---|
| Document Type: | ZIB-Report |
| Date of first Publication: | 1995/05/03 |
| Series (Serial Number): | ZIB-Report (SC-95-12) |
| ZIB-Reportnumber: | SC-95-12 |
| Published in: | Appeared in: Nonlinear Dynamical Systems and Chaos. H. W. Broer, S. A. von Gils, I. Hoveijn, F. Takens (eds.) Birkhäuser 1996, pp. 61-78 |
