29 search results - page 5 / 6 » Counting 1324-Avoiding Permutations |
JCT
2002
14 years 11 months ago
2002
135
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
95
Voted
EJC
2008
14 years 11 months ago
2008
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
109
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
We define incidence matrices to be zero-one matrices with no zero rows or columns. We are interested in counting incidence matrices with a given number of ones, irrespective of th...
85
Voted
DMTCS
2008
14 years 10 months ago
2008
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...