Let L n be the length of a longest increasing subsequence in a random permutation of [1, ..., n]. It is known that the expected value of L n is asymptotically equal to 2 -n as n gets large. This note derives upper bound on the probability that L n &2 -n exceeds certain quantities. In particular, we
On sums of subsequent terms of permutations
โ Scribed by R. Freud
- Publisher
- Akadmiai Kiad
- Year
- 1983
- Tongue
- English
- Weight
- 363 KB
- Volume
- 41
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be a finite abelian group with exponent e, let r(G) be the minimal integer t with the property that any sequence of t elements in G contains an e-term subsequence with sum zero. In this paper we show that if r(C 2 n )=4n&3 and if n ((3m&4)(m&1) m 2 +3)ร4m, then r(C 2 nm )=4nm&3. In particular,
Let Z. be the cyclic group of order n. For a sequence S of elements in Z~, we use f~(S) to denote the number of subsequences, the sum of whose elements is zero. In this paper, we give a characterization on the sequences S of elements in Zn for whichf~(S) < 2 Isl -" รท k -,, under the restriction 1 ~