Sciweavers

29 search results - page 5 / 6
» Counting 1324-Avoiding Permutations
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Counting Subgraphs via Homomorphisms
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...
Omid Amini, Fedor V. Fomin, Saket Saurabh
EJC
2008
13 years 4 months ago
Enumeration of almost polynomial rational functions with given critical values
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...
Dmitri Panov, Dimitri Zvonkine
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 4 months ago
Asymptotics for Incidence Matrix Classes
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...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
DMTCS
2008
80views Mathematics» more  DMTCS 2008»
13 years 3 months ago
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words
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...
Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel