We prove that every orthocomplete homogeneous effect algebra is sharply dominating. Let us denote the greatest sharp element below x by x↓. For every element x of an orthocomple...
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...