Sciweavers

365 search results - page 21 / 73
» On the combinatorics of Galois numbers
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 12 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
COMBINATORICS
2006
120views more  COMBINATORICS 2006»
14 years 12 months ago
Cycle Lengths in a Permutation are Typically Poisson
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
Andrew Granville
COMBINATORICS
2007
75views more  COMBINATORICS 2007»
14 years 12 months ago
Flexibility of Embeddings of Bouquets of Circles on the Projective Plane and Klein Bottle
In this paper, we study the flexibility of embeddings of bouquets of circles on the projective plane and the Klein bottle. The numbers (of equivalence classes) of embeddings of b...
Yan Yang, Yanpei Liu
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
14 years 11 months ago
On a Combinatorial Problem of Asmus Schmidt
For any integer r 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n k=0 n k r n + k k r = n k=0 n k n + k k c (r) k , n = 0, 1, 2, . . . ....
W. Zudilin
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
14 years 11 months ago
When Structures Are Almost Surely Connected
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
Jason P. Bell