91 search results - page 8 / 19 » combinatorics 2000 |
COMBINATORICS
2000
13 years 9 months ago
2000
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...
COMBINATORICS
2000
13 years 9 months ago
2000
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) i...
COMBINATORICS
2000
13 years 9 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
13 years 9 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
COMBINATORICS
2000
13 years 9 months ago
2000
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...