×

zbMATH — the first resource for mathematics

On a correspondence between binary trees and a certain type of permutation. (English) Zbl 0323.05006

MSC:
05A15 Exact enumeration problems, generating functions
05A05 Permutations, words, matrices
05C05 Trees
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Knuth, D.E., The art of computer programming, Vol. 3, (1973), Addison-Wesley Reading, Mass · Zbl 0191.17903
[2] Knuth, D.E., The art of computer programming, Vol. 1, (1968), Addison-Wesley Reading, Mass · Zbl 0191.17903
[3] Schensted, C., Longest increasing and decreasing subsequences, Canad. J. math., 13, 179-191, (1961) · Zbl 0097.25202
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.