Title :
Enumeration of permutations classified by length of longest monotone subsequences
Author :
Kobayashi, Kingo ; Morita, Hiroyoshi ; Hoshi, Mamoru
Author_Institution :
Univ. of Electro-Commun., Chofu, Japan
fDate :
27 Jun-1 Jul 1994
Abstract :
The aim of the paper is to look at the distance structure of the permutation space Sn from the viewpoint of monotone subsequences. An insertion-deletion (moving) operation on permutations which is considered to be the dual concept of monotone subsequencer L is introduced, under which the authors obtain a n formula to clarify the distance structure of the space. As a by-product of the recursion formula, another combinatorial proof for c⩽2 is obtained
Keywords :
combinatorial mathematics; sequences; combinatorial proof; distance structure; insertion-deletion operation; longest monotone subsequences; monotone subsequencer; moving operation; permutations; recursion formula; Erbium; Geometry; Stochastic processes;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394700
