𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An order relation on permutations and extremal problems

✍ Scribed by D. A. Suprunenko

Publisher
Springer US
Year
1982
Tongue
English
Weight
668 KB
Volume
17
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal problems on permutations under
Extremal problems on permutations under cyclic equivalence
✍ P ErdΓΆs; N Linial; S Moran πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 608 KB

How much can a permutation be simplified by means of cyclic rotations? For functions f: S,.-o Z which give a measure of complexity to permutations we are interested in finding where the max is over o e S,, and the min is over u which are cyclically equivalent to o. The measures of complexity consi

An extremal problem of d permutations co
An extremal problem of d permutations containing every permutation of every t elements
✍ Yoshiyasu Ishigami πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 155 KB

Let dr(n) be the smallest number d having d permutations {O'1,O'2 ..... O'd} of [n] such that for every permutation r of every t elements of [n], there exists a ai(I <~i<~d) containing r. For fixed t>~4 and large n, we show dt(n)>~(t-2)! log t n.

On an extremal problem
On an extremal problem
✍ I. Dancs πŸ“‚ Article πŸ“… 1958 πŸ› Akadmiai Kiad 🌐 English βš– 160 KB