English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study the chaos of travelling waves (TW) in unidirectional chains ofbistable maps. Previous numerical results suggested that this property isselective, {\sl viz.}\ given the parameters, there is at most a single(non-trivial) velocity for which the corresponding set of wave profiles haspositive topological entropy. However, mathematical proofs have remainedelusive, in particular because the related symbolic dynamics involves entirepast sequences. Here, we consider instead inite (short) rank approximations forwhich the symbolic dynamics has finite memory. For every possible velocity, wecompute the existence domains of all possible finite type subshifts of TW withpositive entropy. In all examples, chaos of TW turns out to be selective,indeed.

Selective chaos of travelling waves in feedforward chains of bistable maps