q-Enumeration of words by their total variation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

q-Enumeration of words by their total variation

Abstract

In recent work, Mansour [Discrete Math. Theoret. Computer Science 11, 2009, 173--186] considers the problem of enumerating all words of length n over {1,2,...,k} (where k is a given integer), that have the total variation equal to a given integer m. In the present paper we study various types of random words over the infinite alphabet ℕ, where the letters have geometric probabilities. We are interested in the probabilities of words of given type to have a given total variation.
Fichier principal
Vignette du fichier
1475-5654-1-PB.pdf (133.25 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00993529 , version 1 (20-05-2014)

Identifiers

Cite

Ligia Loreta Cristea, Helmut Prodinger. q-Enumeration of words by their total variation. Discrete Mathematics and Theoretical Computer Science, 2011, special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity, Vol. 12 no. 3 (3), pp.139-150. ⟨10.46298/dmtcs.477⟩. ⟨hal-00993529⟩

Collections

TDS-MACS
65 View
643 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More