On Ramsey graphs without cycles of short odd lengths
On relatively prime sets.
On restricted m-ary partitions.
On separating sets of words. I.
On separating sets of words. II.
On separating sets of words. IV.
On separating sets of words. V.
On Sequences satisfying .
On Sets of Integers with Prescribed Gaps.
On some analogues of descent numbers and major index for the hyperoctahedral group.
On some arithmetical properties of middle binomial coefficients
On some arithmetical properties of the Genocchi numbers and polynomials.
On some densities in the set of permutations.
On some identities for the Fibonomial coefficients
On some minimal problem
On some partitions related to .
On some (pseudo) involutions in the Riordan group.
On special partitions of Dedekind- and Russell-sets
A Russell set is a set which can be written as the union of a countable pairwise disjoint set of pairs no infinite subset of which has a choice function and a Russell cardinal is the cardinal number of a Russell set. We show that if a Russell cardinal has a ternary partition (see Section 1, Definition 2) then the Russell cardinal fails to have such a partition. In fact, we prove that if a ZF-model contains a Russell set, then it contains Russell sets with ternary partitions as well as Russell...
On Stanley's partition function.
On sums involving products of three binomial coefficients