365 search results - page 24 / 73 » On the combinatorics of Galois numbers |
COMBINATORICS
2004
14 years 11 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
COMBINATORICS
2000
14 years 11 months ago
2000
We describe matrices whose determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of such a matrix is a list of monomial functions, the entries...
COMBINATORICS
2000
14 years 11 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
107
click to vote
COMBINATORICS
1998
14 years 11 months ago
1998
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
COMBINATORICS
1999
14 years 11 months ago
1999
The parameters 2 - (2 + 2, + 1, ) are those of a residual Hadamard 2 (4 + 3, 2 + 1, ) design. All 2 - (2 + 2, + 1, ) designs with 4 are embeddable. The existence of non-embedd...