β Scribed by Gloria Olive
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given a sample with replacement from a finite set ~, we show simply how to generate a maximal sequence of functions of the sample, all uniform on ~/, such that these functions are pairwise independent. We also consider the problem of generating a sequence of k-wise independent functions of the sampl
## Abstract Motivated by symmetric association schemes (which are known to approximate generously unitransitive group actions), we formulate combinatorial approximations to transitive extensions of generously unitransitive permutation groups. Specifically, the notions of compatible and coherent par
The k-MAXCUT problem for undirected graphs C = (V, E ) consists of finding a partition V = V , U . . . U V, such that the number of edges with endpoints in two different sets V, is maximized. We offer a new approach to this problem by showing that the combinatorial notion of block designs can be use
The theory of correspondence reaches far deeper than that of mere numerical congruity with which it is associated as the substance with the shadow"