Let H denote a finite simple hypergraph. The cover ideal of H, denoted by J = J(H), is the monomial ideal whose minimal generators correspond to the minimal vertex covers of H. We give an algebraic method for determining the chromatic number of H, proving that it is equivalent to a monomial ideal membership problem involving powers of J . Furthermore, we study the sets Ass(R/Js) by exploring th...

The present article rectifies a noticeable lacuna in the analysis of the Mandinka verbal system and offers a detailed discussion of the meaning of the KAŊ locution (i.e. of the analytical expression be + infinitive + kaŋ) as well as a presentation of its most relevant structural properties. First, the author demonstrates that there are no structural or contextual restrictions on the use of the ...

I propose that tense and mood paradigms are grammatical centering systems. Specifically, English tenses form a temporal centering system, which monitors and updates topic times, whereas Kalaallisut moods form a modal centering system, which monitors and updates modal discourse referents. Nevertheless, English and Kalaallisut translation equivalents converge on the same truth conditions, due to ...

The technology of finite-state transducers is implemented to recognize, lemmatize and tag composite tenses in Serbian in a way that connects the auxiliary and main verb. The suggested approach uses a morphological electronic dictionary of simple words and appropriate local grammars.

Tourette's syndrome (TS) is a developmental disorder characterized by motor and verbal tics. The tics, which are fast and involuntary, result from frontal/basal-ganglia abnormalities that lead to unsuppressed behaviors. Language has not been carefully examined in TS. We tested the processing of two basic aspects of language: idiosyncratic and rule-governed linguistic knowledge. Evidence suggest...

A new way of constructing (minimal) perfect hash functions is described. The technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations. The number of accesses to memory is two, one of which is to a fixed location. This improves the...