Allowed patterns of symmetric tent maps via commuter functions

TL;DR

This paper introduces a novel technique using commuter functions to analyze pattern avoidance in symmetric tent maps, demonstrating strict inclusion of allowed pattern sets between different tent maps.

Contribution

The paper presents a new method employing commuter functions to compare pattern sets of non-conjugate dynamical systems, specifically symmetric tent maps.

Findings

Allowed pattern sets of $T_$ are strictly included in those of $T_1$

Commuter functions provide a new tool for studying pattern avoidance

The technique applies to non-conjugate dynamical systems

Abstract

We introduce a new technique to study pattern avoidance in dynamical systems, namely the use of a commuter function between non-conjugate dynamical systems. We investigate the properties of such a commuter function, specifically $h : [0,1] \to [0,1]$ satisfying $T_1 \circ h = h \circ T_\mu$, where $T_\mu$ denotes a symmetric tent map of height $\mu$. We make use of this commuter function to prove strict inclusion of the set of allowed patterns of $T_\mu$ in the set of allowed patterns of $T_1$.