365 search results - page 18 / 73 » On the combinatorics of Galois numbers |
COMBINATORICS
2002
14 years 11 months ago
2002
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
136
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
COMBINATORICS
1998
14 years 11 months ago
1998
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
COMBINATORICS
1999
14 years 11 months ago
1999
We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the comm...
COMBINATORICS
1999
14 years 11 months ago
1999
We give an integral identity which was conjectured and proved by using the continuous version of the multi-WZ method. Submitted: May 25, 1999; Accepted: October 20, 1999. Mathemat...