zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Subdominant positive solutions of the discrete equation Δu(k+n)=-p(k)u(k). (English) Zbl 1101.39003
Siafarikas, Panayiotis D. (ed.), International conference on differential, difference equations and their applications, July 1–5, 2002, Patras, Greece. Cairo: Hindawi Publishing Corporation (ISBN 977-5945-14-3/hbk). 207-216 (2004).
Summary: A delayed discrete equation Δu(k+n)=-p(k)u(k) with positive coefficient p is considered. Sufficient conditions with respect to p are formulated in order to guarantee the existence of positive solutions if k. As a tool of the proof of corresponding result, the method described in the authors’ previous papers is used [cf. J. Diblík, Comput. Math. Appl. 42, No. 3–5, 515–528 (2001; Zbl 0999.39005); J. Baštinec, J. Diblík and B. Zhong, CRC Press. 359–366 (2004; Zbl 1065.39006)]. Except for the fact of the existence of positive solutions, their upper estimation is given. The analysis shows that every positive solution of the indicated family of positive solutions tends to zero (if k) with the speed not smaller than the speed characterized by the function k·(n/(n+1)) k . A comparison with the known results is given and some open questions are discussed.
39A11Stability of difference equations (MSC2000)
39A10Additive difference equations