On summability of subsequences
✍ Scribed by Karl Klee; Peter Szüsz
- Publisher
- Springer-Verlag
- Year
- 1969
- Tongue
- French
- Weight
- 348 KB
- Volume
- 111
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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,