نتایج جستجو برای: perfect complex
تعداد نتایج: 826362 فیلتر نتایج به سال:
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...
در این پایان نامه که شامل سه فصل (پیش نیاز ها،مدول های مین-تصویری روی حلقه های خاص و مدول ها و حلقه های مین-انژکتیو)است ویژگی های مدول های مین-تصویری را روی حلقه های هم تابدار(cotorsion)،منسجم(coherent)،منظم فان-نیومن و تام(perfect) بررسی می کنیم.مدول های مین-انژکتیو دوگان مدول های مین-تصویری هستند.
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
Dolphins are well known for their complex social and foraging behaviours. Direct underwater observations of wild dolphin feeding behaviour however are rare. At mass spawning aggregations of giant cuttlefish (Sepia apama) in the Upper Spencer Gulf in South Australia, a wild female Indo-Pacific bottlenose dolphin (Tursiops aduncus) was observed and recorded repeatedly catching, killing and prepar...
It is shown that, under mild conditions, a complex reflection group G(r, p, n) may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert series identity to these and other closely related groups.
The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید