Let X be a Hausdorff continuum (a compact connected Hausdorff space). Let 2X (respectively, Cn(X)) denote the hyperspace of nonempty closed subsets of X (respectively, nonempty closed subsets of X with at most n components), with the Vietoris topology. We prove that if X is hereditarily indecomposable, Y is a Hausdorff continuum and 2X (respectively Cn(X)) is homeomorphic to 2Y (respectively, C...

We consider a class of matrices of the form Cn = (1/N)(Rn+σXn)(Rn+σXn) ∗, where Xn is an n × N matrix consisting of independent standardized complex entries, Rj is an n×N nonrandom matrix, and σ > 0. Among several applications, Cn can be viewed as a sample correlation matrix, where information is contained in (1/N)RnR ∗ n, but each column of Rn is contaminated by noise. As n → ∞, if n/N → c > 0...

Performance, digestibility of nutrients, microbial nitrogen flow (MNF) and nitrogen efficiency (NE) inearly lactating Holstein cows were investigated by diet supplementation with sodium caseinate (CN).Multiparous lactating Holstein cows (n = 15) with an average body weight of 638 kg and 21 days in milkwere assigned to a completely randomized design (five cows per treatment) and fed a basal diet...

Suppose X = Lp (or Ip), p > 2, and K is a nonempty closed convex bounded subset of X. Suppose T: K —* K is a Lipschitzian strictly pseudo-contractive mapping of K into itself. Let {Cn}^_0 be a real sequence satisfying: (i) 0 < C„ < 1 for all n > 1, (") Z)rT=l Cn = °°> and Then the iteration process, zn G K, Zn+l = (1 — Cn)xn + CnTXn for n > 1, converges strongly to a fixed point of T in K.

In this paper we give a detailed proof of the Jacobian Conjecture (posed in 1939) which says that a polynomial map Cn → Cn is invertible if and only if its Jacobian is a non-zero constant. To prove it we equip both the set of all polynomial automorphisms of Cn and the set of all polynomial endomorphisms of Cn whose Jacobians are non-zero constants with structures of ind-varieties. Then using al...

In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f an assignment such that 0 has at least one neighbor 2 and all vertices labeled by are independent, then called outer independent Roman dominating function (OIRDF). The domination strengthened if 1, 3, each two neighbors double (OIDRDF). weight of (OIDRDF) OIRDF the sum f(v) for v?V. (double) number (?oidR(G)) ?oiR(G) minimum taken ...