12 resultados para Weakly bound nuclei
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.
Resumo:
A simpler proof of a result of Burq [1] is presented.
Resumo:
We present some results on the formation of singularities for C^1 - solutions of the quasi-linear N × N strictly hyperbolic system Ut + A(U )Ux = 0 in [0, +∞) × Rx . Under certain weak non-linearity conditions (weaker than genuine non-linearity), we prove that the first order derivative of the solution blows-up in finite time.
Resumo:
The following problem, suggested by Laguerre’s Theorem (1884), remains open: Characterize all real sequences {μk} k=0...∞ which have the zero-diminishing property; that is, if k=0...n, p(x) = ∑(ak x^k) is any P real polynomial, then k=0...n, p(x) = ∑(μk ak x^k) has no more real zeros than p(x). In this paper this problem is solved under the additional assumption of a weak growth condition on the sequence {μk} k=0...∞, namely lim n→∞ | μn |^(1/n) < ∞. More precisely, it is established that the real sequence {μk} k≥0 is a weakly increasing zerodiminishing sequence if and only if there exists σ ∈ {+1,−1} and an entire function n≥1, Φ(z)= be^(az) ∏(1+ x/αn), a, b ∈ R^1, b =0, αn > 0 ∀n ≥ 1, ∑(1/αn) < ∞, such that µk = (σ^k)/Φ(k), ∀k ≥ 0.
Resumo:
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper is to determine nq(k, d) for d = dk as nq(k, d) = gq(k, d) + 1 for q ≥ k with 3 ≤ k ≤ 8 except for (k, q) = (7, 7), (8, 8), (8, 9).
Resumo:
Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.
Resumo:
2000 Mathematics Subject Classification: 46B26, 46B03, 46B04.
Resumo:
2000 Mathematics Subject Classification: Primary 46E15, 54C55; Secondary 28B20.
Resumo:
Недю Попиванов, Цветан Христов - Изследвани са някои тримерни аналози на задачата на Дарбу в равнината. През 1952 М. Протер формулира нови тримерни гранични задачи както за клас слабо хиперболични уравнения, така и за някои хиперболично-елиптични уравнения. За разлика от коректността на двумерната задача на Дарбу, новите задачи са некоректни. За слабо хиперболични уравнения, съдържащи младши членове, ние намираме достатъчни условия както за съществуване и единственост на обобщени решения с изолирана степенна особеност, така и за единственост на квази-регулярни решения на задачата на Протер.
Resumo:
Л. И. Каранджулов, Н. Д. Сиракова - В работата се прилага методът на Поанкаре за решаване на почти регулярни нелинейни гранични задачи при общи гранични условия. Предполага се, че диференциалната система съдържа сингулярна функция по отношение на малкия параметър. При определени условия се доказва асимптотичност на решението на поставената задача.
Resumo:
2000 Mathematics Subject Classification: 46B30, 46B03.
Resumo:
2000 Mathematics Subject Classification: 05C55.