2597 search results - page 298 / 520 » On numbers of Davenport-Schinzel sequences |
133
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
158
click to vote
CSDA
2008
15 years 6 months ago
2008
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
156
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
145
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
176
Voted
ENTCS
2006
15 years 6 months ago
2006
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...