Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 20, 2014 - 2:29:35 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:22 AM
Long-term archiving on: : Wednesday, August 20, 2014 - 11:36:23 AM


Publisher files allowed on an open archive




Ligia Loreta Cristea, Helmut Prodinger. q-Enumeration of words by their total variation. Discrete Mathematics and Theoretical Computer Science, DMTCS, 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⟩



Record views


Files downloads