—The African diaspora to the Americas was one of plants as well as people. European slavers provisioned their human cargoes with African and other Old World useful plants, which enabled their enslaved work force and free maroons to establish them in their gardens. Africans were additionally familiar with many Asian plants from earlier crop exchanges with the Indian subcontinent. Their efforts e...

Neighborhood-perfect graphs form a subclass of the perfect graphs if the Strong Perfect Graph Conjecture of C. Berge is true. However, they are still not shown to be perfect. Here we propose the characterization of neighborhood-perfect graphs by studying minimal non-neighborhood-perfect graphs (MNNPG). After presenting some properties of MNNPGs, w e show that the only MNNPGs with neighborhood i...

2 Algorithm for Fp, p > 2 2 2.1 Alternate formulation of Chernoff bound . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Returning to proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Digression on Perfect Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Finishing proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . ...

This paper examines the pure-strategy subgame-perfect equilibrium payoffs in discounted supergames with perfect monitoring. It is shown that the payoff sets are typically fractals unless they are full-dimensional, which may happen when the discount factors are large enough. More specifically, the equilibrium payoffs can be identified as subsets of self-affine sets or graph-directed self-affine ...

Using smooth one-fixed-point actions on spheres and a result due to Bob Oliver on the tangent representations at fixed points for smooth group actions on disks, we obtain a similar result for perfect group actions on spheres. For a finite group G, we compute a certain subgroup IO′(G) of the representation ring RO(G). This allows us to prove that a finite perfect group G has a smooth 2–proper ac...

The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph G is said to be n-rotation symmetric if the cyclic group of order n is a subgroup of the automorphism group of G. Jockusch (Perfect matchings and perfect squares, J. Combin. Theory Ser. A, 67(1994), 100-115) and Kuperberg (An exploration of the permanent-deter...

Let G be a connected semisimple group. Vinberg introduced the notion of perfect submonoids dominant weights in study monoids. In this paper, we give explicit descriptions submonoids.