๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some permutation problems

โœ Scribed by L Carlitz; Richard Scoville


Book ID
103507068
Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
588 KB
Volume
22
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The three-permutations problem
โœ P.C. Fishburn; W.V. Gehrlein ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 332 KB

Given any three permutations on { 1, . . , n}, we want to choose f : { 1, . . . , n} + { -1, 1) so that the maximum absolute partial sum off values over the permutations is minimized. The three-permutations problem is to determine the supremum of this minimum taken over all n and all triples of perm

Some remarks on permutation designs
โœ W Braun; H de Graaff ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB
Some considerations on permutation trees
โœ A. Panayotopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 456 KB

This paper deals with the determination of subsets of permutations, which satisfy certain conditions. Two new methods are proposed; one for the permutations that correspond to a given pattern, and one for the triple T = (A, M, CM) as it has been introduced by Viennot [S]. Both these two methods, can