Abstract

An extremal problem considering sequences related to Davenport-Schinzel sequences is investigated in this paper. We prove that f(x k ; n) = O(n) where the quantity on the left side is defined as the maximum length m of the sequence u = a 1 a 2 ::a m of integers such that 1) 1 a r n, 2) a r = a s ; r 6= s implies jr \Gamma sj k and 3) u contains no subsequence of the type x k (x stands for xx::x i-times).

Citations

98	Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 - Hart, Sharir - 1986
69	Sharp upper and lower bounds on the lengths of general Davenport-Schinzel sequences - Agarwal, Sharir, et al. - 1989
62	Planar realizations of nonlinear Davenport-Schinzel sequences by segments - Wiernik, Sharir - 1988
46	A combinatorial problem connected with differential equations - Davenport, Schinzel - 1965
23	Generalized Davenport-Schinzel sequences with linear upper bound - Adamec, Klazar, et al. - 1992
1	EDI On a problem by Davenport and Schinzel, Acta Arithmetica 15 - SZEMER - 1974