365 search results - page 31 / 73 » On the combinatorics of Galois numbers |
COMBINATORICS
2004
14 years 11 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
COMBINATORICS
2000
14 years 11 months ago
2000
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
103
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...
COMBINATORICS
2002
14 years 11 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
COMBINATORICS
1998
14 years 11 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...