We settle some conjectures formulated by A. Claesson and T. Mansour concerning generalized pattern avoidance of permutations. In particular, we solve the problem of the enumeration of permutations avoiding three generalized patterns of type (1, 2) or (2, 1) by using ECO method and a graphical representation of permutations.

Enumerating permutations avoiding three Babson-Steingrimsson patterns / A. Bernini; L. Ferrari; R. Pinzani. - In: ANNALS OF COMBINATORICS. - ISSN 0218-0006. - STAMPA. - 9:(2005), pp. 137-162. [10.1007/s00026-005-0246-6]

Enumerating permutations avoiding three Babson-Steingrimsson patterns

BERNINI, ANTONIO;FERRARI, LUCA;PINZANI, RENZO
2005

Abstract

We settle some conjectures formulated by A. Claesson and T. Mansour concerning generalized pattern avoidance of permutations. In particular, we solve the problem of the enumeration of permutations avoiding three generalized patterns of type (1, 2) or (2, 1) by using ECO method and a graphical representation of permutations.
2005
9
137
162
A. Bernini; L. Ferrari; R. Pinzani
File in questo prodotto:
File Dimensione Formato  
avoiding_3_babson_steingrimsson.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 251.42 kB
Formato Adobe PDF
251.42 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/368160
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 11
social impact