In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...
3 For d, k N with k 2d, let g(d, k) denote the infimum density of binary4 sequences (xi)iZ {0, 1}Z which satisfy the minimum degree condition d j=1 (xi+j +5
Fingerprint friction ridge details are generally described in a hierarchical order at three levels, namely, Level 1 (pattern), Level 2 (minutiae points) and Level 3 (pores and rid...
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Let EN = (e1, e2, . . . , eN ) be a binary sequence with ei {+1, -1}. For 2 k N, the correlation measure of order k of the sequence is defined by Mauduit and S