... There is a growing number of different approaches, bracketing, polygon dissection, plane trees, intervals and so on, which result in Stasheff polytopes. ...
... Arthur-Merlin Games in Boolean Decision Trees". Journal of Computer Systems Sciences 59 (1999) 346-372, . B. Durand, A. Shen, and N. Vereshchagin. ...
... All of these lemma together gives the following tree T of values for bamboo trees: 0 -1 -2 -3/2 1/2 3/4 7/8 13/16 1 -7/4 COMBINATORIAL GAME THEORY 7 Each external node of T is labelled by a relative integer, and each internal node v is labelled by the ...
... 2 On combinatorial prop erties of Rauzy graphs: trees constructed of cycles Mikhail Dubashinsky Chebyshev Laboratory, Saint ... Graph R( ) is "a tree constructed of cycles" if and only if the permutation 0 : i m + 1 - i (i = 1, . ...
... This is true, in particular, of product logics determined by product frames one component of which is a finite linear order or a finite transitive tree and the other is a transitive tree or a partial (quasi- or linear) order. ...
... The strata of $\rmod{2k,l}$ correspond to real curves of genus zero with different degeneration types and are encoded by trees with certain decorations. ...