José María Amigó ; Sergi Elizalde ; Matthew B. Kennel - Pattern avoidance in dynamical systems

dmtcs:3635 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008) - https://doi.org/10.46298/dmtcs.3635
Pattern avoidance in dynamical systemsArticle

Authors: José María Amigó 1; Sergi Elizalde ORCID2; Matthew B. Kennel 3

  • 1 Centro de Investigacion Operativa
  • 2 Department of Mathematics [Dartmouth]
  • 3 Institute for Nonlinear Science

Orbits generated by discrete-time dynamical systems have some interesting combinatorial properties. In this paper we address the existence of forbidden order patterns when the dynamics is generated by piecewise monotone maps on one-dimensional closed intervals. This means that the points belonging to a sufficiently long orbit cannot appear in any arbitrary order. The admissible patterns are then (the inverses of) those permutations avoiding the so-called forbidden root patterns in consecutive positions. The last part of the paper studies and enumerates forbidden order patterns in shift systems, which are universal models in information theory, dynamical systems and stochastic processes. In spite of their simple structure, shift systems exhibit all important features of low-dimensional chaos, allowing to export the results to other dynamical systems via order-isomorphisms. This paper summarizes some results from [1] and [11].


Volume: DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
Keywords: order patterns,deterministic and random sequences,permutations avoiding consecutive patterns,time series analysis,dynamical systems,shift maps,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 260 times.
This article's PDF has been downloaded 365 times.