We consider the problem of covering the complete r-uniform hypergraphs on n vertices using complete r-partite graphs. We obtain lower bounds on the size of such a covering. For small values of r our result implies a lower bound of Ω( e r r √ r n log n) on the size of any such covering. This improves the previous bound of Ω(rn log n) due to Snir [5]. We also obtain good lower bounds on the size ...

The original purpose of what follows was to deal with a problem that arises for ‘pure result state’ accounts of the perfect, which treat perfects as operators that transform event and state descriptions into descriptions of corresponding result states and make these the target of location in time by tenses and temporal adverbs. In the form in which we endorsed this approach for many years ((Kam...

The role of boundary conditions within physics is seen to be analogous to that of “context” within human perception. Moreover, the human mind is able to create its own context by focusing attention on an object in the foreground, while simultaneously filtering out other objects in the background. We propose that a physical system may have the capacity to establish its own boundary conditions – ...

The Eskimo language Kalaallisut (alias West Greenlandic) has traditionally been described as having a rich tense system, with three future tenses (Kleinschmidt 1851, Bergsland 1955, Fortescue 1984) and possibly four past tenses (Fortescue 1984). Recently however, Shaer (2003) has challenged these traditional claims, arguing that Kalaallisut is in fact tenseless. This paper settles the debate, i...

The article analyzes the ways of predicate expressing in Act Book Zhytomyr Hrodsky government 1611. main source for study specified part a sentence was above-mentioned manuscript official business style beginning 17th century. It is act book that determined functioning mostly past tense forms, given record court cases about already committed crimes. method sampling analyzed material and techniq...

Coercion is an inferential process through which operator-argument conflicts are resolved in favor of the meaning of the operator, as when frame adverbials impose inchoative readings upon state-type predicates with which they are combined: The ambulance was there in a few minutes. De Swart (1998) represents such effects by means of implicit type-shifting operators that intervene between operato...

A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set φ1, . . . , φs of linear functionals from V to F with the following property: for all t subsets X ⊆ V there exists i ∈ {1, . . . , s} such that φi is injective when restricted to F . A linear (qd, q, t)-perfect hash family of minimal size d(t− 1) is said to be optimal. I...

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-simple (v, 5, 2)-BIBDs with possible exceptions of v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}. In this article, we investigate the existence of a super-simple (v, 5, 4)-BIBD and show that such a design exi...

We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bitboards. Moreover, we show that simple variations of these schemes give minimal perfect hashing schemes. The new method is applicable provided N , the number of k-bit spaced positions that may be set to 1, is not more t...