Signatures des permutations et des mots extraits. (Signatures of permutations and extracted words)
type: Item
instance of: scholarly article
title: Signatures des permutations et des mots extraits. (Signatures of permutations and extracted words)
zbMATH Open document ID: 0629.05002
DOI: 10.1016/0012-365X(88)90042-8
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Any finite injective word of n letters written with a totally ordered alphabet (in particular any permutation) has a specific ``signature'' characterized by the n-1 successive increases \((+)\) or decreases (-). The main result of the paper is that the number of permutations of given signature from which a given word w can be extracted depends only on the signature of w; a method generalizing Viennot's algorithm is given for the calculation of this number.
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 06A05
zbMATH DE Number: 4023283
zbMATH Keywords: word
zbMATH Keywords: totally ordered alphabet
zbMATH Keywords: permutation
zbMATH Keywords: Viennot's algorithm
author: Germain Kreweras
author: Paul Moszkowski
MaRDI profile type: Publication
cites work: A note on permutations with fixed pattern
cites work: Permutations with prescribed pattern
cites work: Q5603208
cites work: Q3283895
cites work: Q5549086
cites work: Permutations ayant une forme donnée
full work available at URL: 0012-365x(88)90042-8
OpenAlex ID: W2064799061
description: scientific article; zbMATH DE number 4023283