Counting and generating permutations using timed languages (long version) - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Counting and generating permutations using timed languages (long version)

Résumé

The signature of a permutation $\sigma$ is a word whose letter of index i is d when $sigma$ has a descent (i.e. $\sigma(i)>\sigma(i+1)$) and is a when $\sigma$ has an ascent (i.e. $\sigma(i)<\sigma(i+1)$). Combinatorics of permutations with a prescribed signature is quite well explored. Given a language over the alphabet {a,d}, we associate to it the class of permutations with signature in the language. Here we state and address the two problems of counting and randomly generating for every classes of permutations associated to a regular language. First we give an algorithm that computes a closed form formula for the exponential generating function of such a class. Then we give an algorithm that given a regular language L and an integer n generates randomly the n-length permutations of the class associated to L in a uniform manner, i.e. all the permutations of length n with signature in L are equally probable to be returned. Both contributions are based on a geometric interpretation of a subclass of regular timed languages.
Fichier principal
Vignette du fichier
autreversionlongue.pdf (444.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00820373 , version 1 (04-05-2013)
hal-00820373 , version 2 (02-10-2013)

Identifiants

  • HAL Id : hal-00820373 , version 2

Citer

Nicolas Basset. Counting and generating permutations using timed languages (long version). 2013. ⟨hal-00820373v2⟩
293 Consultations
219 Téléchargements

Partager

Gmail Facebook X LinkedIn More