𝔖 Bobbio Scriptorium
✦   LIBER   ✦

α-Times Integrated Semigroups (α ∈ R+)

✍ Scribed by Milorad Mijatović; Stevan Pilipović; Fikret Vajzović


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
225 KB
Volume
210
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis


The ␣-times integrated semigroups, ␣ ) 0, are introduced and analyzed. It is shown that suitable differential operators generate ␣-times integrated semigroups Ž . for ␣ g 1r2, 1 .


📜 SIMILAR VOLUMES


Extensions R[α − a] ∩&#xa
✍ Junro Sato; Susumu Oda; Ken-ichi Yoshida 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 64 KB

Let R be an integral domain and ␣ an anti-integral element of degree d over R. w x w Ž . y1 x w x w y1 x It is shown that the equality R ␣ y a l R ␣ y a s R ␣ l R ␣ holds for any a g R with ␣ y a / 0.

On the Integral Closedness of the RingR[
✍ Satoru Taeda; Susumu Oda; Ken-ichi Yoshida 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Throughout this paper, all fields, rings, and algebras are assumed to be commutative with unity. Our special notation is indicated below, and our w x general reference for unexplained technical terms is M1 . In what follows, we use the following notation unless otherwise specified: R is a Noetheri

Stability of the Recursive Sequence xn&#
✍ Mona T. Aboutaleb; M.A. El-Sayed; Alaa E. Hamza 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 69 KB

In this paper we investigate the global asymptotic stability of the recursive , n s 0, 1, . . . , where ␣, ␤, ␥ G 0. We show that the unique positive equilibrium point of the equation is a global attractor with a basin that depends on the conditions posed on the coefficients.

Hamilton-connectivity of 3-Domination Cr
✍ Yaojun Chen; Feng Tian; Yunqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A graph G is 3-domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. It was proved by Favaron et al. that α ≤ δ + 2 for any connected 3-domination critical graph. Denote by τ (G) the toughness of a graph G. Recently Chen et al. conjectured that a connecte