83 search results - page 16 / 17 » combinatorics 2002 |
COMBINATORICS
2002
13 years 5 months ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
MLQ
2002
13 years 5 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
LATA
2010
Springer
13 years 9 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
APPML
2002
13 years 5 months ago
2002
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Wh-phrases in English have two important properties: first, they can appear both raised and in-situ; second, while in-situ wh-phrases can take semantic scope beyond the immediately...