Publication date
November 1988
DOI Publisher
Published by Elsevier Inc. ISSN
0097-3165 Citation count (estimate)
14Abstract
AbstractA simplified construction for a nonlinear Davenport-Schinzel sequence is given. This proves λ2s + 1(n) = Ω(nαs(n))
AbstractA simplified construction for a nonlinear Davenport-Schinzel sequence is given. This proves λ2s + 1(n) = Ω(nαs(n))
The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identi...
summary:In the first part of the paper we are concerned about finite sequences (over arbitrary symbo...
We survey in detail extremal results on Davenport–Schinzel sequences and their generalizations, from...
A different kind of sequence was introduced in this study. A Davenport-Schinzel sequence is a finite...
AbstractA finite sequence u = a1a2 … ap of some symbols is contained in another sequence v = b1b2 … ...
AbstractOne class of Davenport-Schinzel sequences consists of finite sequences over n symbols withou...
AbstractA generalized Davenport–Schinzel sequence is one over a finite alphabet whose subsequences a...
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequence...
AbstractWe obtain sharp upper and lower bounds on the maximal length λs(n) of (n, s)-Davenport-Schin...
A finite sequence u = a 1 a 2 : : : a p of some symbols is contained in another sequence v = b 1 b 2...
Let an (r,s)-formation be a concatenation of s permutations of r distinct letters, and let a block o...
AbstractDavenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate re...
3 The extremal function Ex(u, n) (introduced in the theory of Davenport-Schinzel sequences in other ...
One of the longest-standing open problems in computational geometry is to bound the lower envelope o...
AbstractIt is shown that any word of lengthnis uniquely determined by all its[formula]subwords of le...
The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identi...
summary:In the first part of the paper we are concerned about finite sequences (over arbitrary symbo...
We survey in detail extremal results on Davenport–Schinzel sequences and their generalizations, from...
A different kind of sequence was introduced in this study. A Davenport-Schinzel sequence is a finite...
AbstractA finite sequence u = a1a2 … ap of some symbols is contained in another sequence v = b1b2 … ...
AbstractOne class of Davenport-Schinzel sequences consists of finite sequences over n symbols withou...
AbstractA generalized Davenport–Schinzel sequence is one over a finite alphabet whose subsequences a...
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequence...
AbstractWe obtain sharp upper and lower bounds on the maximal length λs(n) of (n, s)-Davenport-Schin...
A finite sequence u = a 1 a 2 : : : a p of some symbols is contained in another sequence v = b 1 b 2...
Let an (r,s)-formation be a concatenation of s permutations of r distinct letters, and let a block o...
AbstractDavenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate re...
3 The extremal function Ex(u, n) (introduced in the theory of Davenport-Schinzel sequences in other ...
One of the longest-standing open problems in computational geometry is to bound the lower envelope o...
AbstractIt is shown that any word of lengthnis uniquely determined by all its[formula]subwords of le...
The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identi...
summary:In the first part of the paper we are concerned about finite sequences (over arbitrary symbo...
We survey in detail extremal results on Davenport–Schinzel sequences and their generalizations, from...
Add to ORKG