Sciweavers

492 search results - page 40 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
13 years 4 months ago
On Descents in Standard Young Tableaux
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...
Peter A. Hästö
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
13 years 4 months ago
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
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...
Vassili C. Mavron
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
13 years 4 months ago
Random Sampling of Labeled Tournaments
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...
Lisa McShine
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
13 years 4 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
13 years 4 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
Vera Rosta