Sciweavers

365 search results - page 24 / 73
» On the combinatorics of Galois numbers
Sort
View
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
15 years 6 months ago
Short Cycles in Random Regular Graphs
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...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
COMBINATORICS
2000
90views more  COMBINATORICS 2000»
15 years 6 months ago
Determinantal Expression and Recursion for Jack Polynomials
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...
Luc Lapointe, Alain Lascoux, Jennifer Morse
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
15 years 6 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
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 ...
Martin Klazar
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
15 years 5 months ago
Increasing Subsequences and the Classical Groups
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...
Eric M. Rains
COMBINATORICS
1999
62views more  COMBINATORICS 1999»
15 years 5 months ago
An infinite Family of Non-embeddable Hadamard Designs
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...
Kirsten Mackenzie-Fleming