We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...

A graph is Berge if no induced subgraph of it is an odd cycle of length at least five or the complement of one. In joint work with Robertson, Seymour, and Thomas we recently proved the Strong Perfect Graph Theorem, which was a conjecture about the chromatic number of Berge graphs. The proof consisted of showing that every Berge graph either belongs to one of a few basic classes, or admits one o...

In the last twenty years several methods for computing primary decompositions of ideals in multivariate polynomial rings over fields (Seidenberg (1974), Lazard (1985), Kredel (1987), Eisenbud et al. (1992)), the integers (Seidenberg, 1978), factorially closed principal ideal domains (Ayoub (1982), Gianni et al. (1988)) and more general rings (Seidenberg, 1984) have been proposed. A related prob...

Normal graphs are defined in terms of cross-intersecting set families: a graph is normal if it admits a clique cover Q and a stable set cover S s.t. every clique in Q intersects every stable set in S. Normal graphs can be considered as closure of perfect graphs by means of co-normal products (K ̈orner [6]) and graph entropy (Czisz ́ar et al. [5]). Perfect graphs have been recently characterized a...

We show  that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. Hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. As aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. This generalizes and simplifies a result of  Dung and   Smith. As another consequen...

It is proved that every commutative ring whose RD-injective modules are Σ-RD-injective is the product of a pure semi-simple ring and a finite ring. A complete characterization of commutative rings for which each artinian (respectively simple) module is RD-injective, is given. These results can be obtained by using the properties of RD-flat modules and RD-coflat modules which are respectively th...

THEOREM 1.1 (U. Sattes). Let r > 2 and g E C[O, l]\B$,‘. Then f”EB$’ is a best approximation to g, in L” (such a best approximation necessari/J) exisrs) if and only if there exists a subinterual (a, /?) c IO. 1 I and a positilse integer M > r + 1 for which the following conditions hold (i) f”l,n.ll, is a Perfect spline of degree r with exactly) M ~ r -1 knots arzd I.f”““(s)l = I a. e. on [u,pI....

Archaeologists working on plantation sites have typically ignored the role that violence played in the lives of enslaved African-Americans. By drawing together examples from archaeological publications in which violence has been mentioned, the commentary illustrates not only both the types and scale of violence endured by African-Americans, but also how archaeologists have effectively sanitized...