We give the generating function for the integer sequence enumerating a class of pattern avoiding permutations depending on two parameters: image and image. The avoided patterns are the permutations of length image with the largest element in the first position and the second largest in one of the last image positions. For particular instances of image and image we obtain pattern avoiding classes enumerated by Schröder, Catalan and central binomial coefficient numbers, and thus, the obtained two-parameter generating function gathers under one roof known generating functions and expresses new ones. This work generalizes some earlier results of Barcucci et al. (2000) , Kremer (2000) and Kremer (2003) .
Generalized Schröder permutations / E. Barcucci; V. Vajnovszki. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 502:(2013), pp. 210-216. [10.1016/j.tcs.2012.02.039]
Generalized Schröder permutations
BARCUCCI, ELENA;
2013
Abstract
We give the generating function for the integer sequence enumerating a class of pattern avoiding permutations depending on two parameters: image and image. The avoided patterns are the permutations of length image with the largest element in the first position and the second largest in one of the last image positions. For particular instances of image and image we obtain pattern avoiding classes enumerated by Schröder, Catalan and central binomial coefficient numbers, and thus, the obtained two-parameter generating function gathers under one roof known generating functions and expresses new ones. This work generalizes some earlier results of Barcucci et al. (2000) , Kremer (2000) and Kremer (2003) .File | Dimensione | Formato | |
---|---|---|---|
TCS502.pdf
Accesso chiuso
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Tutti i diritti riservati
Dimensione
306.82 kB
Formato
Adobe PDF
|
306.82 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.