{"docId":1489,"paperId":1279,"url":"https:\/\/dmtcs.episciences.org\/1279","doi":"10.46298\/dmtcs.1279","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":155,"name":"Vol. 18 no. 2, Permutation Patterns 2015"}],"section":[{"sid":61,"title":"Permutation Patterns","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"1508.05310","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/1508.05310v3","dateSubmitted":"2016-05-16 04:18:14","dateAccepted":null,"datePublished":"2016-06-01 09:43:53","titles":["Snow Leopard Permutations and Their Even and Odd Threads"],"authors":["Egge, Eric S.","Rubin, Kailee"],"abstracts":["Caffrey, Egge, Michel, Rubin and Ver Steegh recently introduced snow leopard permutations, which are the anti-Baxter permutations that are compatible with the doubly alternating Baxter permutations. Among other things, they showed that these permutations preserve parity, and that the number of snow leopard permutations of length $2n-1$ is the Catalan number $C_n$. In this paper we investigate the permutations that the snow leopard permutations induce on their even and odd entries; we call these the even threads and the odd threads, respectively. We give recursive bijections between these permutations and certain families of Catalan paths. We characterize the odd (resp. even) threads which form the other half of a snow leopard permutation whose even (resp. odd) thread is layered in terms of pattern avoidance, and we give a constructive bijection between the set of permutations of length $n$ which are both even threads and odd threads and the set of peakless Motzkin paths of length $n+1$.","Comment: 25 pages, 6 figures. Version 3 is modified to use standard Discrete Mathematics and Theoretical Computer Science but is otherwise unchanged"],"keywords":["Mathematics - Combinatorics","05A05, 05A15"]}