1215 search results - page 86 / 243 » Combinatorics |
125
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
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...
121
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
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 ...
110
click to vote
COMBINATORICS
2000
15 years 3 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...
124
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
Let d(n) count the lattice paths from (0, 0) to (n, n) using the steps (0,1), (1,0), and (1,1). Let e(n) count the lattice paths from (0, 0) to (n, n) with permitted steps from th...
145
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...