SOME CYTOTAXONOMIC PROBLEMS IN THE CRASSULACEAE
نویسندگان
چکیده
منابع مشابه
CYTOTAXONOMIC STUDIES OF SOME IRANIAN VICIA SPECIES (FABACAEA)
This study concerns the cytotaxonomic investigations on twelve species belonging to three sections from the genus Vicia in Iran. A taxonomic background of the genus is given in brief. The previous counts reported for the genus in Index to plant chromosome number are summarized. In addition to one new count, the chromosome numbers of four species are reported for the first time. Briefly, the ...
متن کاملCYTOTAXONOMIC STUDIES IN WEST HIMALAYAN BRYACEAE (MUSCI)
The meiotic chromosomes of 10 species (Pohlia elongata, Anomobryum cymbifolium, Brachymenium acuminatum, B. ochianum, B. sikkimense, Bryum cellulare, B. pseudotriquetrum, B. apiculatum, B. capillare and B. atrovirense), in four genera of the family Bryaceae of acrocarpous mosses are studied with special emphasis on their evolution, polyploidy and cytological features with reference to interrela...
متن کاملSome problems in topology
Broadly speaking, we may say that analysis situs, or topology, deals with the properties of geometrical figures that remain invariant when the figures are subjected to arbitrary continuous transformations. There are, however, several distinct kinds of analysis situs, because there are several distinct ways of interpreting the physical notion of continuity in mathematical language. For example, ...
متن کاملSome Problems in Growing
Sugar beets are grown for sugar in 22 States—Michigan, Ohio, Indiana, Illinois, Wisconsin, Minnesota, Iowa, Kansas, Nebraska, South Dakota, North Dakota, Colorado, Montana, Texas, New Mexico, Utah, Idaho, Oregon, Washington, Arizona, Wyoming, and California. They are grown in New Mexico, Arizona, Utah, Nevada, California, and Oregon for seed. Almost 20 percent of the national sugar requirem.ent...
متن کاملSome Problems in Combinatorics
Let In = {1, 2, . . . , n} and x : In 7→ R be a map such that ∑ i∈In x(i) ≥ 0. (For any i, its image is denoted by x(i).) Let F = {J ⊂ In : |J | = k, and ∑ j∈J x(j) ≥ 0}. In [25] Manickam and Singhi have conjectured that |F| ≥ ( n−1 k−1 ) whenever n ≥ 4k and showed that the conclusion of the conjecture holds when k divides n. For any two integers r and ` let [r]` denote the smallest positive in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolution
سال: 1961
ISSN: 0014-3820
DOI: 10.1111/j.1558-5646.1961.tb03162.x