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

On the number of queries necessary to identify a permutation

โœ Scribed by Ker-I Ko; Shia-Chung Teng

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
744 KB
Volume
7
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Number of Permutations Avoiding a
On the Number of Permutations Avoiding a Given Pattern
โœ Noga Alon; Ehud Friedgut ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c