Abstract. Let S be an abelian finitely generated semigroup of endomorphisms of a probability space (Ω,A, μ), with (T1, ..., Td) a system of generators in S. Given an increasing sequence of domains (Dn) ⊂ N, a question is the convergence in distribution of the normalized sequence |Dn| 12 ∑ k∈Dn f ◦ T , or normalized sequences of iterates of barycenters Pf = ∑ j pjf ◦ Tj, where T k = T k1 1 ...T ...

−ε2∆u + V (x)u + ψu = f(u) in R, −ε2∆ψ = u in R, u > 0, u ∈ H(R), has been studied extensively, where the assumption for f(u) is that f(u) ∼ |u|p−2u with 4 < p < 6 and satisfies the Ambrosetti–Rabinowitz condition which forces the boundedness of any Palais– Smale sequence of the corresponding energy functional of the equation. The more difficult critical case is studied in this paper. As g(u) :...

background and objectives: the increase of infections caused by nontuberculous mycobacteria (ntm) is receiving increasing attention worldwide. mycobacterium fortuitum is encountered with increasing frequency in clinical laboratories of iran. materials and methods: sequence variation of 48 m. fortuitum clinical isolates, were investigated by sequence analysis of the 16s-23s internal transcribed ...

this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job&apos;s tardiness and mean of job&apos;s completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...

Let E = F (v) be the ground-state eigenvalue of the Schrödinger Hamiltonian H = −∆ + vf(x), where the potential shape f(x) is symmetric and monotone increasing for x > 0, and the coupling parameter v is positive. If the kinetic potential f̄(s) associated with f(x) is defined by the transformation f̄(s) = F ′(v), s = F (v) − vF ′(v), then f can be reconstructed from F by the sequence f [n+1] = f̄ ◦...

In this paper, we analyze the recurrence relations generalized from the Tower of Hanoi problem of the form T (n, α, β) = min1≤t≤n{αT (n− t, α, β)+β S(t, 3)}, where S(t, 3) = 2−1 is the optimal solution for the 3-peg Tower of Hanoi problem. It is shown that when α and β are natural numbers and α ≥ 2, the sequence of differences of T (n, α, β)’s, i.e., T (n, α, β) − T (n − 1, α, β), consists of n...