100
click to vote
COMBINATORICS
2004
15 years 2 months ago
2004
An antichain is a collection of sets in which no two sets are comparable under set inclusion. An antichain A is flat if there exists an integer k 0 such that every
77
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
COMBINATORICS
2004
15 years 2 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
76
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
102
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
Given a sequence {Qn(x)} n=0 of symmetric orthogonal polynomials, defined by a recurrence formula Qn(x) = n
81
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
105
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
109
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
74
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
122
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...