215 search results - page 1 / 43 » On the number of factorizations of a full cycle |
JCT
2006
14 years 10 months ago
2006
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic me...
JCT
2008
14 years 10 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
78
Voted
JGT
2007
14 years 10 months ago
2007
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...
MOC
2002
14 years 9 months ago
2002
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
84
Voted
ISPASS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we introduce PTLsim, a cycle accurate full system x86-64 microprocessor simulator and virtual machine. PTLsim models a modern superscalar out of order x86-64 proces...