365 search results - page 25 / 73 » On the combinatorics of Galois numbers |
117
click to vote
FMCAD
2008
Springer
15 years 1 months ago
2008
Springer
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
COMBINATORICS
2006
14 years 12 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
COMBINATORICS
2007
14 years 11 months ago
2007
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · × Zrk ) Sn and calculate its multi-distribution with some natural ...
COMBINATORICS
2007
14 years 11 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
107
click to vote
COMBINATORICS
2004
14 years 11 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...