Pattern Avoidance of Generalized Permutations release_idbmngs2vzgrvkd2vz2snsvilu

by Zhousheng Mei, Suijie Wang

Released as a article .

2018  

Abstract

In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding π is independent of the choice of π∈ S_3, which extends the classic results on permutations avoiding π∈ S_3. Extending both Dyck path and Riordan path, we introduce the Catalan-Riordan path which turns out to be a combinatorial interpretation of the difference array of Catalan numbers. As applications, we interpret both Motzkin and Riordan numbers in two ways, via semistandard Young tableaux of two rows and generalized permutations avoiding π∈ S_3. Analogous to Lewis's method, we establish a bijection from generalized permutations to rectangular semistandard Young tableaux which will recover several known results in the literature.
In text/plain format

Archived Files and Locations

application/pdf  203.1 kB
file_mgbjflcmkzcsbb7jvokjmztzya
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-04-27
Version   v2
Language   en ?
arXiv  1804.06265v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 865333e2-27f8-4dac-bb21-1b8d1de17392
API URL: JSON