A finite sequence u = ala2 . up of some symbols is contained in another sequence c = h1b2.. b, if there is a subsequence b,,bi, b,, of u which can be identified, after an injective renaming of symbols, with u. We say that u = u1a2.. .up is k-regular if i -j > k whenever a, = a,, i > j. We denote fur
✦ LIBER ✦
A simplified construction of nonlinear Davenport-Schinzel sequences
✍ Scribed by Péter Komjáth
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 298 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Combinatorial aspects of Davenport-Schin
✍
Martin Klazar
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 994 KB
On numbers of Davenport-Schinzel sequenc
✍
Martin Klazar
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 522 KB
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bijective encoding of such sequences by rooted plane trees with distinguished nonleaves and we give a combinatorial proof of
Improved lower bounds on the length of D
✍
Micha Sharir
📂
Article
📅
1988
🏛
Springer-Verlag
🌐
English
⚖ 421 KB
Momentopes, the Complexity of Vector Par
✍
S. Aviran; S. Onn
📂
Article
📅
2002
🏛
Springer
🌐
English
⚖ 96 KB
A method of construction of nonlinear ge
✍
A. M. Romankevich
📂
Article
📅
1978
🏛
Springer US
🌐
English
⚖ 167 KB
Rat cages of simplified construction
✍
Long, J. A.
📂
Article
📅
1924
🏛
John Wiley and Sons
🌐
English
⚖ 411 KB
👁 1 views