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...
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...
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...
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, . . . ....
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...