Let k, v, t be integers such that k v t 2. A perfect hash family PHF(N; k, v, t) can be defined as an N ? k array with entries from a set of v symbols such that every N ?t suba...
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
Let p be a prime, q = pm and Fq be the finite field with q elements. In this paper, we will consider q-ary sequences of period qn - 1 for q > 2 and study their various balance ...
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...