On the maximum lengths of Davenport-Schinzel sequences

نویسنده

  • Martin Klazar
چکیده

The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identical consecutive elements and no 5-term alternating subsequence. Improving the constant factor in the previous bounds of Hart and Sharir, and of Sharir and Agarwal, we prove that N5(n) < 2nα(n) +O(nα(n) ), where α(n) is the inverse to the Ackermann function. Quantities Ns(n) can be generalized and any finite sequence, not just an alternating one, can be assigned extremal function. We present a sequence with no 5-term alternating subsequence and with an extremal function n2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Keywords. Davenport{schinzel Sequence; Tree; Extremal Problem 0 Extremal Problems for Colored Trees and Davenport{schinzel Sequences

In the theory of generalized Davenport{Schinzel sequences one estimates the maximum lengths of nite sequences containing no subsequence of a given pattern. Here we investigate a further generalization, in which the class of sequences is extended to the class of colored trees. We determine exactly the extremal functions associated with the properly 2-colored path of four vertices and with the mo...

متن کامل

Extremal problems for colored trees and Davenport-Schinzel sequences

In the theory of generalized Davenport–Schinzel sequences one estimates the maximum lengths of finite sequences containing no subsequence of a given pattern. Here we investigate a further generalization, in which the class of sequences is extended to the class of colored trees. We determine exactly the extremal functions associated with the properly 2-colored path of four vertices and with the ...

متن کامل

Three Generalizations of Davenport-Schinzel Sequences

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-s double DS sequences, for all s, sharp bounds on sequences avoiding catenated permutations (aka formation free sequences), and new lower bounds on sequences avoiding zig-zagging patterns.

متن کامل

Generalized Davenport–Schinzel sequences: results, problems, and applications

We survey in detail extremal results on Davenport–Schinzel sequences and their generalizations, from the seminal papers of H. Davenport and A. Schinzel in 1965 to present. We discuss geometric and enumerative applications, generalizations to colored trees, and generalizations to hypergraphs. Eleven illustrative examples with proofs are given and nineteen open problems are posed.

متن کامل

Extremal functions for sequences

Davenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate repetition and with no alternating subsequence (i.e. of the type ababab . . .) of the length s. This concept based on a geometrical motivation is due to Davenport and Schinzel in the middle of sixties. In the late eighties strong lower and upper (superlinear) bounds on the maximum length of the DS(s) seque...

متن کامل

Davenport-Schinzel sequences and their geometric applications

An (n; s) Davenport{Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation a b a b of length s + 2 between two distinct symbols a and b. The close relationship between Davenport{Schinzel sequences and the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997