91 search results - page 6 / 19 » combinatorics 2000 |
COMBINATORICS
2000
13 years 9 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
COMBINATORICS
2000
13 years 9 months ago
2000
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infini...
COMBINATORICS
2000
13 years 9 months ago
2000
In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the norma...
COMBINATORICS
2000
13 years 9 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
COMBINATORICS
2000
13 years 9 months ago
2000
We consider the problem of determining when two delta-matroids on the same ground-set have a common base. Our approach is to adapt the theory of matchings in 2-polymatroids develo...