In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their lengths. Here we tackle the problem of refining this enumeration by considering the statistics “first/last entry”. We give results for at least one of the mentioned statistics for every generalized patterns of type (1,2) or (2,1) as well as for some cases of permutations avoiding a pair of generalized patterns of the above types.

Some statistics on permutations avoiding generalized patterns / Bernini, Antonio; Bouvel, M; Ferrari, Luca. - STAMPA. - (2006), pp. 1-11. (Intervento presentato al convegno GASCom 2006 tenutosi a Dijon (France) nel 11-15 settembre 2006).

Some statistics on permutations avoiding generalized patterns

BERNINI, ANTONIO;FERRARI, LUCA
2006

Abstract

In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their lengths. Here we tackle the problem of refining this enumeration by considering the statistics “first/last entry”. We give results for at least one of the mentioned statistics for every generalized patterns of type (1,2) or (2,1) as well as for some cases of permutations avoiding a pair of generalized patterns of the above types.
2006
GASCom 2006
GASCom 2006
Dijon (France)
11-15 settembre 2006
Bernini, Antonio; Bouvel, M; Ferrari, Luca
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/260281
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact