Characterization of the allowed patterns of signed shifts

详细信息    查看全文

• 作者：Kassie Archer ^{karcher@uttyler.edu}
• 关键词：Permutations ; Allowed patterns ; Signed shifts ; Infinite words ; Tent map
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：30 January 2017
• 年：2017
• 卷：217
• 期：part_P2
• 页码：97-109
• 全文大小：462 K
• 卷排序：217

文摘

The allowed patterns of a map are those permutations in the same relative order as the initial segments of orbits realized by the map. In this paper, we characterize and provide enumerative bounds for the allowed patterns of signed shifts, a family of maps on infinite words.