COMBINATORICS
2006
13 years 11 months ago
2006
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
CSL
2010
Springer
14 years 9 days ago
2010
Springer
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
LKR
2008
14 years 19 days ago
2008
Abstract. Extensive work has been done in recent years on automatically grouping words into categories. For example, {Wednesday, Monday, Tuesday} could be grouped into a `days of w...