We study the relation between binary words excluding a pattern and proper Riordan arrays. In particular, we prove necessary and sufficient conditions under which the number of words counted with respect to the number of zeroes and ones bits are related to proper Riordan arrays. We also give formulas for computing the generating functions (d(x),h(x)) defining the Riordan array.

Binary words excluding a pattern and proper Riordan arrays / D. BACCHERINI; D. MERLINI; R. SPRUGNOLI. - In: DISCRETE MATHEMATICS. - ISSN 0012-365X. - STAMPA. - 307 (9-10):(2007), pp. 1021-1037. [10.1016/j.disc.2006.07.023]

Binary words excluding a pattern and proper Riordan arrays

MERLINI, DONATELLA;SPRUGNOLI, RENZO
2007

Abstract

We study the relation between binary words excluding a pattern and proper Riordan arrays. In particular, we prove necessary and sufficient conditions under which the number of words counted with respect to the number of zeroes and ones bits are related to proper Riordan arrays. We also give formulas for computing the generating functions (d(x),h(x)) defining the Riordan array.
2007
307 (9-10)
1021
1037
D. BACCHERINI; D. MERLINI; R. SPRUGNOLI
File in questo prodotto:
File Dimensione Formato  
r26.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 151.03 kB
Formato Adobe PDF
151.03 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/215864
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 9
social impact