Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Melkamu Zeleke"'
Autor:
Samuel Asefa Fufa, Melkamu Zeleke
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 49:51-69
In this paper, we compute the Mobius function of pointed integer partition and pointed ordered set partition using topological and analytic methods. We show that the associated order complex is a wedge of spheres and compute the associated reduced ho
Autor:
Bansil, Pooja, Asnakew Yeshiwondim, Guinovart, Caterina, Belendia Serda, Scott, Callie, Berhane Tesfay, Agmas, Adem, Belay Bezabih, Melkamu Zeleke, Girma Guesses, Asmamaw Ayenew, Worku Workie, Earle, Duncan, Steketee, Rick, Asefaw Getachew
Additional file 1. Study profile of index cases and FTAT investigation, by village.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3852da27356583a178689555ef7aa11a
Publikováno v:
Journal of Plant Breeding and Crop Science. 6:77-83
A laboratory experiment was performed at Ambo University, Department of Plant Sciences in March 2014, to evaluate the effect of moisture stress on germination and seedling growths of highland maize cultivars. The experiment was arranged factorially i
Autor:
Scott, Callie, Asnakew Yeshiwondim, Belendia Serda, Guinovart, Caterina, Berhane Tesfay, Agmas, Adem, Melkamu Zeleke, Girma Guesses, Asmamaw Ayenew, Worku Workie, Steketee, Richard, Earle, Duncan, Belay Bezabih, Asefaw Getachew
Additional file 1: Table S1. Odds of a Pv, Pf, or mixed RDT-positive result by risk factor for individuals under 10 years of age. Table S2. Odds of a Pv, Pf, or mixed RDT-positive result by risk factor for individuals 10 years of age and older.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e166dc4cab8f37db8712833d2185e7e
Publikováno v:
Annals of Combinatorics. 6:375-382
A k-tree is constructed from a single distinguished k-cycle by repeatedly gluing other k-cycles to existing ones along an edge. If K is any nonempty subset of {2, 3, 4, . . .}, then a K-tree is obtained as above using k-cycles with $ k \in K $ . In t
Autor:
Robert G. Rieper, Melkamu Zeleke
Publikováno v:
Advances in Applied Mathematics. 27(2-3):671-681
We use a known combinatorial argument to prove that among all ordered trees the ratio of the total number of vertices to leaves is two. We introduce a new combinatorial bijection on the set of these trees that shows why this must be so. Ordered trees
Autor:
Jamie Simpson, Melkamu Zeleke
Publikováno v:
Advances in Applied Mathematics. 23:322-332
Berger, Felzenbaum, and Fraenkel characterized all disjoint covering systems with precisely one multiple modulus, the multiplicity of which does not exceed 9. In this paper we characterize disjoint covering systems with precisely one multiple modulus
Autor:
Melkamu Zeleke, Shalosh B. Ekhad
Publikováno v:
Journal of Difference Equations and Applications. 5:319-322
In this paper we construct counterexamples to show that is not injective i.e.,a multiset of 27 elements cannot be recovered from its triple-sums unqiuely
Autor:
Joaquín Gómez Rey, Wu Wei Chao, Emre Alkan, John Wickner, Scott Beslin, Valerio De Angelis, Keivan Mallahi, Zheng-Ping Tian, Donald Knuth, Matthias Beck, Akalu Tefera, Melkamu Zeleke, Sergei Ovchinnikov, Yan-loi Wong, Emeric Deutsch, Frank A. Horrigan, Lou Shapiro, Jerrold W. Grossman, Philip D. Straffin, Murray S. Klamkin, George T. Gilbert, Brian D. Beasley, Lenny Jones, Karen Blount, Beth Stockslager
Publikováno v:
Mathematics Magazine. 71:389
Autor:
Melkamu Zeleke, Tewodros Amdeberhan
Publikováno v:
Journal of Computational and Applied Mathematics. (2):251-255
In the present work, we give a proof of the injectivity of the combinatorial Radon transform of order five.