Scalar Operators Representable as a Sum of Projectors

We study sets there exist n projectors P₁,...,P_n such that . We prove that if n 6, then .     

两类广泛递归序列的动力特性

We investigate the dynamics of two extensive classes of recursive sequences:xn+1=c∑ k ∑xn-ioxn-i1…xn-i2j+f(xn-io,xn-i1,…,xn-i2k)j=0(i0,i1,…,i2j)∈A2j/c∑ k ∑xn-ioxn-i1…xn-i2j-1+c+f(xn-io,xn-i1,…,xn-i2k)j=1(i0,i1,…,i2j)∈A2j-1 and xn+1=c∑ k ∑xn-ioxn-i1…xn-i2j-1+c+f(xn-io,xn-i1,…,xn-i2k)j=1(i0,i1,…,i2j)∈A2j-1/c∑ k ∑xn-ioxn-i1…xn-i2j+f(xn-io,xn-i1,…,xn-i2k)j=0(i0,i1,…,i2j)∈A2j We prove that their unique positive equilibrium x = 1 is globally asymptotically stable.And a new access is presented to study the theory of recursive sequences.     

Wave recursive interpolation

In this paper it is studied that the generated theory of wave recursive interpolation of uniform T-subdivi-ston scheme include wave parameter.The paper analyses the convergence of sequences of control polygons produced by wave recursive interpolation T-subdivision scheme of the formj=l,2,…,T-1;m=O,l,…,nTk;k=0,l,2,…,and differentiability of the limit curve.     

A NECESSARY AND SUFFICIENT CONDITION FOR THE OSCILLATION OF HIGHER-ORDER NEUTRAL EQUATIONS WITH SEVERAL DELAYS

Consider the higher-order neutral delay differential equationd~t/dt~n(x(t)+sum from i=1 to lp_ix(t-τ_i)-sum from j=1 to mr_jx(t-ρ_j))+sum from k=1 to Nq_kx(t-u_k)=0,(A)where the coefficients and the delays are nonnegative constants with n≥2 even. Then anecessary and sufficient condition for the oscillation of (A) is that the characteristicequationλ~n+λ~nsum from i=1 to lp_ie~(-λτ_i-λ~n)sum from j=1 to mr_je~(-λρ_j)+sum from k=1 to Nq_ke~(-λρ_k)=0has no real roots.     

Irreducibility of dynamics and representation of KMS states in terms of Lévy processes

Quantum systems described by the Schr?dinger operators with Φ being continuous functions such that the pseudo-differential operators Φ(p_j) generate Lévy processes, are considered. It is proven that the linear span of the operators is dense in the algebra of all observables in the σ-strong and hence in the σ-weak and strong topologies. Here are time automorphisms and the F’s are taken from families of multiplication operators obeying conditions described in the paper. This result implies that a linear functional continuous in either of these topologies is fully determined by its values on such products. In the case of KMS states this yields a representation of such states in terms of path integrals. Received: 22 December 2004     

Evolution systems and perturbations of generators of strongly continuous groups

Suppose A generates a strongly continuous linear group on a Banach space X and B is a linear operator on X. It is shown that an extension of generates a strongly continuous semigroup if and only if the family of operators has an appropriate evolution system. This produces simple sufficient conditions for an extension of to generate a strongly continuous semigroup, including

Some estimates of solutions of degenerate (k,o)-elliptic equations

A class of nonlinear second-order equations of divergent form is distinguished, whose solutions have properties recalling the properties of solutions of ordinary elliptic equations. In the linear case these are equations of the form $$\sum\nolimits_{j = 1}^k \lambda _j (x)A_j^2 u + \sum\nolimits_{j = 1}^k {\mu _j (x)A_j u + c(x)u + f(x) = 0,} $$ where the \(A_j = \sum\nolimits_{\alpha = 1}^n {\alpha _j^\alpha (x)\frac{\partial }{{\partial x^\alpha }}(1 \leqslant j \leqslant k)} \) are linearly independent first-order differential operators whose Lie algebra is of rank n, 2 ? k ? n, and theλj(x) ? 0 are functions which can become0 zero or increase in a definite way. Harnack's inequality is proved for nonnegative solutions of these equations.     

解一般矩阵方程的GPBiCG(m,l)法

The generalized product bi-conjugate gradient(GPBiCG(m,l))method has been recently proposed as a hybrid variant of the GPBi CG and the Bi CGSTAB methods to solve the linear system Ax=b with non-symmetric coefficient matrix,and its attractive convergence behavior has been authenticated in many numerical experiments.By means of the Kronecker product and the vectorization operator,this paper aims to develop the GPBi CG(m,l)method to solve the general matrix equation■ and the general discrete-time periodic matrix equations■ which include the well-known Lyapunov,Stein,and Sylvester matrix equations that arise in a wide variety of applications in engineering,communications and scientific computations.The accuracy and efficiency of the extended GPBi CG(m,l)method assessed against some existing iterative methods are illustrated by several numerical experiments.     

Nearly Quartic Mappings in β-Homogeneous F-Spaces

In this paper, we investigate the Hyers–Ulam stability of the following quartic equation $$\begin{array}{ll} {\sum\limits^{n}_{k=2}}\left({\sum\limits^{k}_{i_{1}=2}}{\sum\limits^{k+1}_{i_{2}=i_{1}+1}} \ldots {\sum\limits^{n}_{i_{n-k+1}=i_{n-k}+1}}\right)\\ \quad\times f \left({\sum\limits^{n}_{i=1,i \neq i_{1},\ldots,i_{n-k+1}}} x_{i}-{\sum\limits^{n-k+1}_{r=1}}x_{i_{r}}\right) + f \left({\sum\limits^{n}_{i=1}}x_{i}\right)\\ \quad-2^{n-2}{\sum\limits^{}_{1 \leq{i} \leq{j} \leq{n}}}(f(x_{i} + x_{j}){+f(x_{i} - x_{j})){+2^{n-5}(n - 2){\sum\limits^{n}_{i=1}}f(2x_{i})}} = \theta \end{array} $$ $({n \in \mathbb{N}, n \geq 3})$ in β-homogeneous F-spaces.     

Асимптотические рав енства для интеграло в от модуля суммы кратн ого ряда из синусов

Assume that the coefficients of the series $$\mathop \sum \limits_{k \in N^m } a_k \mathop \Pi \limits_{i = 1}^m \sin k_i x_i $$ satisfy the following conditions: a) a_k → 0 for k₁ + k₂ + ...+k_m →∞, b) \(\delta _{B,G}^M (a) = \mathop {\mathop \sum \limits_{k_i = 1}^\infty }\limits_{i \in B} \mathop {\mathop \sum \limits_{k_j = 2}^\infty }\limits_{j \in G} \mathop {\mathop \sum \limits_{k_v = 0}^\infty }\limits_{v \in M\backslash (B \cup G)} \mathop \Pi \limits_{i \in B} \frac{1}{{k_i }}|\mathop \sum \limits_{I_j = 1}^{[k_j /2]} (\nabla _{l_G }^G (\Delta _1^{M\backslash B} a_k ))\mathop \Pi \limits_{j \in G} l_j^{ - 1} |< \infty ,\) for ∨B?M, ∨G?M,B∩G, where M={1,2, ...,m}, $$\begin{gathered} \,\,\,\,\,\,\,\,\,\,\,\,\Delta _1^j a_k = a_k - a_{k_{M\backslash \{ j\} } ,k_{j + 1} } ,\Delta _1^B a_k = \Delta _1^{B\backslash \{ j\} } (\Delta _1^j a_k ), \hfill \\ \Delta _{l_j }^j a_k = a_{k_{M\backslash \{ j\} } ,k_j - l_j } - a_{k_{M\backslash \{ j\} } ,k_j + l_j } ,\nabla _{l_G }^G a_k = \nabla _{l_{G\backslash \{ j\} } }^{G\backslash \{ j\} } (\nabla _{l_j }^j a_k ). \hfill \\ \end{gathered} $$ Then for all n∈N^m the following asymptotic equation is valid: $$\mathop \smallint \limits_{{\rm T}_{\pi /(2n + 1)}^m } |\mathop \sum \limits_{k \in N^m } a_k \mathop \Pi \limits_{i \in M} \sin k_i x_i |dx = \mathop \sum \limits_{k = 1}^n \left| {a_k } \right|\mathop \Pi \limits_{i \in M} k^{ - 1} + O(\mathop {\mathop \sum \limits_{B,{\mathbf{ }}G \subset M} }\limits_{B \ne M} \delta _{B,G}^M (a)).$$ Here \(T_{\pi /(2n + 1)}^m = \left\{ {x = (x1,x2,...,xm):\pi /(2n + 1) \leqq xi \leqq \pi ;i = \overline {1,m} } \right\}\) . In the one-dimensional case such an equation was proved by S. A. Teljakovskii.     

Analysis of uniform binary subdivision schemes for curve design

The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form

Another hybrid conjugate gradient algorithm for unconstrained optimization

Another hybrid conjugate gradient algorithm is subject to analysis. The parameter β _k is computed as a convex combination of (Hestenes-Stiefel) and (Dai-Yuan) algorithms, i.e. . The parameter θ _k in the convex combination is computed in such a way so that the direction corresponding to the conjugate gradient algorithm to be the Newton direction and the pair (s _k , y _k ) to satisfy the quasi-Newton equation , where and . The algorithm uses the standard Wolfe line search conditions. Numerical comparisons with conjugate gradient algorithms show that this hybrid computational scheme outperforms the Hestenes-Stiefel and the Dai-Yuan conjugate gradient algorithms as well as the hybrid conjugate gradient algorithms of Dai and Yuan. A set of 750 unconstrained optimization problems are used, some of them from the CUTE library.      

Fourier coefficients of Siegel cusp forms of genus n

Let F(Z) be a cusp form of integral weight k relative to the Siegel modular group Sp_n(Z) and let f(N) be its Fourier coefficient with index N. Making use of Rankin's convolution, one proves the estimate (1) $$f(\mathcal{N}) = O(\left| \mathcal{N} \right|^{\tfrac{k}{2} - \tfrac{1}{2}\delta (n)} ),$$ where $$\delta (n) = \frac{{n + 1}}{{\left( {n + 1} \right)\left( {2n + \tfrac{{1 + ( - 1)^n }}{2}} \right) + 1}}.$$ Previously, for n ≥ 2 one has known Raghavan's estimate $$f(\mathcal{N}) = O(\left| \mathcal{N} \right|^{\tfrac{k}{2}} )$$ In the case n=2, Kitaoka has obtained a result, sharper than (1), namely: (2) $$f(\mathcal{N}) = O(\left| \mathcal{N} \right|^{\tfrac{k}{2} - \tfrac{1}{4} + \varepsilon } ).$$ At the end of the paper one investigates specially the case n=2. It is shown that in some cases the result (2) can be improved to, apparently, unimprovable estimates if one assumes some analogues of the Petersson conjecture. These results lead to a conjecture regarding the optimal estimates of f(N), n=2.     

On some new identities for the Fibonomial coefficients

Let F _n be the nth Fibonacci number. The Fibonomial coefficients \(\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F\) are defined for n ≥ k > 0 as follows $$\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F = \frac{{F_n F_{n - 1} \cdots F_{n - k + 1} }} {{F_1 F_2 \cdots F_k }},$$ with \(\left[ {\begin{array}{*{20}c} n \\ 0 \\ \end{array} } \right]_F = 1\) and \(\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F = 0\) . In this paper, we shall provide several identities among Fibonomial coefficients. In particular, we prove that $$\sum\limits_{j = 0}^{4l + 1} {\operatorname{sgn} (2l - j)\left[ {\begin{array}{*{20}c} {4l + 1} \\ j \\ \end{array} } \right]_F F_{n - j} = \frac{{F_{2l - 1} }} {{F_{4l + 1} }}\left[ {\begin{array}{*{20}c} {4l + 1} \\ {2l} \\ \end{array} } \right]_F F_{n - 4l - 1} ,}$$ holds for all non-negative integers n and l.     

On the normalizing multiplier of the generalized Jackson kernel

We consider the question of evaluating the normalizing multiplier $$\gamma _{n,k} = \frac{1}{\pi }\int_{ - \pi }^\pi {\left( {\frac{{sin\tfrac{{nt}}{2}}}{{sin\tfrac{t}{2}}}} \right)^{2k} dt} $$ for the generalized Jackson kernel J _n,k (t). We obtain the explicit formula $$\gamma _{n,k} = 2\sum\limits_{p = 0}^{\left[ {k - \tfrac{k}{n}} \right]} {( - 1)\left( {\begin{array}{*{20}c} {2k} \\ p \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {k(n + 1) - np - 1} \\ {k(n - 1) - np} \\ \end{array} } \right)} $$ and the representation $$\gamma _{n,k} = \sqrt {\frac{{24}}{\pi }} \cdot \frac{{(n - 1)^{2k - 1} }}{{\sqrt {2k - 1} }}\left[ {1\frac{1}{8} \cdot \frac{1}{{2k - 1}} + \omega (n,k)} \right],$$ , where $$\left| {\omega (n,k)} \right| < \frac{4}{{(2k - 1)\sqrt {ln(2k - 1)} }} + \sqrt {12\pi } \cdot \frac{{k^{\tfrac{3}{2}} }}{{n - 1}}\left( {1 + \frac{1}{{n - 1}}} \right)^{2k - 2} .$$ .     

Optimal recovery methods for the integral on classes of differentiable functions

Найдены методы восст ановления интеграла по информации $$I\left( f \right) = \left\{ {f^{(j)} \left( {x_i } \right)\left( {j = 0, ..., \gamma _i - 1; i = 1, ..., n; 1 \leqq \gamma _i \leqq r; \gamma _i + ... + \gamma _n \leqq N} \right.} \right\},$$ оптимальные на класс ахW _p ^r ,r=1,2,...; 1≦p≦∞. Это позволило, в частност и, получить наилучшие для классаW _p ^r квадратурные форму лы вида $$\mathop \smallint \limits_0^1 f\left( x \right)dx = \mathop \Sigma \limits_{i = 1}^n \mathop \Sigma \limits_{j = 1}^{\gamma _i - 1} a_{ij} f^{(j)} \left( {x_i } \right) + \mathop \Sigma \limits_{j = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} b_j f^{(2j - 1)} \left( 0 \right) + \mathop \Sigma \limits_{k = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} c_k f^{(2k - 1)} \left( 1 \right) + R\left( f \right)$$ И $$\mathop \smallint \limits_0^1 f\left( x \right)dx = af\left( 0 \right) + \mathop \Sigma \limits_{i = 1}^n \mathop \Sigma \limits_{j = 0}^{\gamma _i - 1} a_{ij} f^{(j)} \left( {x_i } \right) + bf\left( 1 \right) + \mathop \Sigma \limits_{j = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} b_j f^{(2j - 1)} \left( 0 \right) + \mathop \Sigma \limits_{k = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} c_k f^{(2k - 1)} \left( 1 \right) + R\left( f \right).$$      

A Generalization of Pincherle's Theorem to k-Term Recursion Relations

In 1894, Pincherle proved a theorem relating the existence of a minimal solution of three-term recursion relations to the convergence of a continued fraction. The present paper deals with solutions of an infinite system $$q_n = \sum\limits_{j - 1}^{k - 1} {_{Pk - j,n} } q_{n - j} ,\quad p_{1,n} \ne 0,\quad n = 0,1, \ldots ,$$ of k-term recursion relations with coefficients in a field F. We study the connection between such relations and multidimensional ((k ? 2)-dimensional) continued fractions. A multidimensional analog of Pincherle's theorem is established.     

Criterion of polynomial increase of a function and its derivatives

ДОкАжАНО, ЧтО Дль тОгО, ЧтОБы Дльr РАж ДИФФЕРЕНцИРУЕМОИ НА пРОМЕжУткЕ [А, + ∞) ФУНкцИИf сУЩЕстВОВА л тАкОИ МНОгОЧлЕН (1) $$P(x) = \mathop \Sigma \limits_{\kappa = 0}^{r - 1} a_k x^k ,$$ , ЧтО (2) $$\mathop {\lim }\limits_{x \to + \infty } (f(x) - P(x))^{(k)} = 0,k = 0,1,...,r - 1,$$ , НЕОБхОДИМО И ДОстАтО ЧНО, ЧтОБы схОДИлсь ИН тЕгРАл (3) $$\int\limits_a^{ + \infty } {dt_1 } \int\limits_{t_1 }^{ + \infty } {dt_2 ...} \int\limits_{t_{r - 1} }^{ + \infty } {f^{(r)} (t)dt.}$$ ЕслИ ЁтОт ИНтЕгРАл сх ОДИтсь, тО Дль кОЁФФИц ИЕНтОВ МНОгОЧлЕНА (1) ИМЕУт МЕс тО ФОРМУлы $$\begin{gathered} a_{r - m} = \frac{1}{{(r - m)!}}\left( {\mathop \Sigma \limits_{j = 1}^m \frac{{( - 1)^{m - j} f^{(r - j)} (x_0 )}}{{(m - j)!}}} \right.x_0^{m - j} + \hfill \\ + ( - 1)^{m - 1} \left. {\mathop \Sigma \limits_{l = 0}^{m - 1} \frac{{x_0^l }}{{l!}}\int\limits_a^{ + \infty } {dt_1 } \int\limits_{t_1 }^{ + \infty } {dt_2 ...} \int\limits_{t_{m - l - 1} }^{ + \infty } {f^{(r)} (t_{m - 1} )dt_{m - 1} } } \right),m = 1,2,...,r. \hfill \\ \end{gathered}$$ ДОстАтОЧНыМ, НО НЕ НЕОБхОДИМыМ Усл ОВИЕМ схОДИМОстИ кРА тНОгО ИНтЕгРАлА (3) ьВльЕтсь схОДИМОсть ИНтЕгРАл А \(\int\limits_a^{ + \infty } {x^{r - 1} f^{(r)} (x)dx}\)      

Mean value of weyl sums

We give a simple proof of a mean value theorem of I. M. Vinogradov in the following form. Suppose P, n, k, τ are integers, P≥1, n≥2, k≥n (τ+1), τ≥0. Put $$J_{k,n} (P) = \int_0^1 \cdots \int_0^1 {\left| {\sum\nolimits_{x = 1}^P {e^{2\pi i(a_1 x + \cdots + a_n x^n )} } } \right|^{2k} da_1 \ldots da_n .} $$ Then $$J_{k,n} \leqslant n!k^{2n\tau } n^{\sigma n^2 u} \cdot 2^{2n^2 \tau } P^{2k - \Delta } ,$$ where $$\begin{gathered} u = u_\tau = min(n + 1,\tau ), \hfill \\ \Delta = \Delta _\tau = n(n + 1)/2 - (1 - 1/n)^{\tau + 1} n^2 /2. \hfill \\ \end{gathered} $$      

一类振荡积分算子在Wiener 共合空间上的有界性

假设a,b0并且K_(a,b)(x)=(e~(i|x|~(-b)))/(|x|~(n+a))定义强奇异卷积算子T如下:Tf(x)=(K_(a,b)*f)(x),本文主要考虑了如上定义的算子T在Wiener共合空间W(FL~p,L~q)(R~n)上的有界性.另一方面,设α,β0并且γ(t)=|t|~k或γ(t)=sgn(t)|t|~k.利用振荡积分估计,本文还研究了算子T_(α,β)f(x,y)=p.v∫_(-1)~1f(x-t,y-γ(t))(e~(2πi|t|~(-β)))/(t|t|~α)dt及其推广形式∧_(α,β)f(x,y,z)=∫_(Q~2)f(x-t,y-s,z-t~ks~j)e~(-2πit)~(-β_1_s-β_2)t~(-α_1-1)s~(-α_2-1)dtds在Wiener共合空间W(FL~p,L~q)上的映射性质.本文的结论足以表明,Wiener共合空间是Lebesgue空间的一个很好的替代.