Set partitions with successions and separations.
Sets, lists and noncrossing partitions.
Some combinatorics involving ξ-large sets
We prove a version of the Ramsey theorem for partitions of (increasing) n-tuples. We derive this result from a version of König's infinity lemma for ξ-large trees. Here ξ < ε₀ and the notion of largeness is in the sense of Hardy hierarchy.
Some summation formulae over the set of partitions.
Sur le problème des aspects
Symmetric partitions and pairings
The lattice of partitions and the sublattice of non-crossing partitions of a finite set are important objects in combinatorics. In this paper another sublattice of the partitions is investigated, which is formed by the symmetric partitions. The measure whose nth moment is given by the number of non-crossing symmetric partitions of n elements is determined explicitly to be the "symmetric" analogue of the free Poisson law.
Symmetric sum-free partitions and lower bounds for Schur numbers.