Sciweavers

17 search results - page 1 / 4
» Matchings Avoiding Partial Patterns and Lattice Paths
Sort
View
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 3 months ago
Matchings Avoiding Partial Patterns and Lattice Paths
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
Vít Jelínek, Nelson Y. Li, Toufik Ma...
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 3 months ago
Matchings Avoiding Partial Patterns
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on t...
William Y. C. Chen, Toufik Mansour, Sherry H. F. Y...
COMBINATORICS
2004
86views more  COMBINATORICS 2004»
13 years 3 months ago
Multiple Pattern Avoidance with respect to Fixed Points and Excedances
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
Sergi Elizalde
PR
2007
134views more  PR 2007»
13 years 3 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
CIKM
2007
Springer
13 years 9 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...