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

On the number of derangements of a sharplyk-ply transitive set of permutations

โœ Scribed by Werner Heise; Harald Kunde

Publisher
Springer
Year
1977
Tongue
English
Weight
58 KB
Volume
15
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The action of a few permutations on r-tu
The action of a few permutations on r-tuples is quickly transitive
โœ Joel Friedman; Antoine Joux; Yuval Roichman; Jacques Stern; Jean-Pierre Tillich ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 212 KB ๐Ÿ‘ 1 views

We prove that for every r and dG 2 there is a C such that for most choices of d permutations , , . . . , of S , the following holds: for any two r-tuples of distinct 1 2 d n ร„ 4 elements in 1, . . . , n , there is a product of less than C log n of the s which map the first i r-tuple to the second. A

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