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...

Abstract Frank Knight's theory of monopoly price has received relatively little attention in the literature on Risk, Uncertainty and Profit . We argue that Knight accepted refined Carl Menger his followers. highlights difference between as an inevitable outcome departures from perfect competition, a contingent or ‘culture-history fact’. In latter case, coercive institutional barriers to potenti...

Abstract We develop a simple two-sector neoclassical growth model in which the upstream sector produces intermediate goods, and downstream final goods with outputs from upstream. While features perfect competition, firms engage Cournot competition charge markup. show that deregulation introduction of not only increases productivity but also has substantial spillover effect on factor prices. cal...

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...

We consider the size of circuits that perfectly hash an arbitrary subset S⊂{0, 1} of cardinality 2 into {0, 1}. We observe that, in general, the size of such circuits is exponential in 2k−m, and provide a matching upper bound.

We give various reformulations of the Strong Perfect Graph Conjecture, based on a study of forced coloring procedures, uniquely colorable subgraphs and ! ? 1-cliques in minimal imperfect graphs.

The amount of at retrieval time is one of the when looking for such functioiis. evidence about the effectivensss reduce the memory requirements perfect hash function proposed