Banded perturbations of the unit vector basis in some sequence spaces

Perturbations of the unit vector basis of the formX _n =Σ_|j−n|≦m a _nj e _j wherem is a fixed positive integer are investigated. It is shown that if |a _nj |≦1 and if {x _n } possesses a biorthogonal sequence uniformly bounded inl _p for some 1<=p<∞, then {x _n } is a seminormalized basic sequence in some reflexive Orlicz spacel _N, then {x_n} is equivalent to {e _n} inl _N.     

Note on the local growth of iterated polynomials

The local behavior of the iterates of a real polynomial is investigated. The fundamental result may be stated as follows: THEOREM. Let x_i, for i=1, 2, ..., n+2, be defined recursively by x_i+1=f(x_i), where x₁ is an arbitrary real number and f is a polynomial of degree n. Let x_i+1?x_i≧1 for i=1, ..., n + 1. Then for all i, 1 ≦i≦n, and all k, 1≦k≦n+1?i, $$ - \frac{{2^{k - 1} }}{{k!}}< f\left[ {x_1 ,... + x_{i + k} } \right]< \frac{{x_{i + k + 1} - x_{i + k} + 2^{k - 1} }}{{k!}},$$ where f[x_i, ..., x_i+k] denotes the Newton difference quotient. As a consequence of this theorem, the authors obtain information on the local behavior of the solutions of certain nonlinear difference equations. There are several cases, of which the following is typical: THEOREM. Let {x_i}, i = 1, 2, 3, ..., be the solution of the nonlinear first order difference equation x_i+1=f(x_i) where x₁ is an arbitrarily assigned real number and f is the polynomial \(f(x) = \sum\limits_{j = 0}^n {a_j x^j } ,n \geqq 2\) . Let δ be positive with δ^n?1=|2^n?1/n!a_n|. Then, if n is even and a_n<0, there do not exist n + 1 consecutive increments Δx_i=x_i+1?x_i in the solution {x_i} with Δx_i≧δ. The special case in which the iterated polynomial has integer coefficients leads to a “nice” upper bound on a generalization of the van der Waerden numbers. Ap _k -sequence of length n is defined to be a strictly increasing sequence of positive integers {x ₁, ...,x _n } for which there exists a polynomial of degree at mostk with integer coefficients and satisfyingf(x _j )=x _j+1 forj=1, 2, ...,n?1. Definep _k (n) to be the least positive integer such that if {1, 2, ...,p _k (n)} is partitioned into two sets, then one of the two sets must contain ap _k -sequence of lengthn. THEOREM. p_n?2(n)≦(n!)^(n?2)!/2.     

Bernstein type operators having 1 and x j as fixed points

For certain generalized Bernstein operators {L _n } we show that there exist no i, j ∈ {1, 2, 3,…}, i < j, such that the functions e _i (x) = x ⁱ and e _j (x) = x ^j are preserved by L _n for each n = 1, 2,… But there exist infinitely many e _i such that e ₀(x) = 1 and e _j (x) = x _j are its fixed points.     

Inequalities for tails of adapted processes with an application to Wald's lemma

In this paper we introduce a new tail probability version of Wald's lemma for expectations of randomly stopped sums of independent random variables. We also make a connection between the works of Klass^{(18, 19)} and Gundy⁽¹¹⁾ on Wald's lemma. In making the connection, we develop new Lenglart and Good Lambda inequalities comparing the tails of various types of adapted processes. As a consequence of our Good Lambda inequalities we include the following result. Let {d _i }, {e _i } be two sequences of variables adapted to the same increasing sequence of σ-fields ? _n ↗?, (e.g., ? _n =σ({d _i } _i=1 ⁿ , {E _i } _i=1 ⁿ ), and letN?∞ be a stopping time adapted to {? _n }. Then for allp>0, there exists a constant 0<C _p <∞ depending onp only, such that $$\mathop {\overline {\lim } }\limits_\lambda \lambda ^p P\left( {\mathop {\sup }\limits_{1 \leqslant n \leqslant N} \left\| {\sum\limits_{i = 1}^n {d_i } } \right\| > \lambda } \right) \leqslant C_p \mathop {\overline {\lim } }\limits_\lambda \lambda ^p P\left( {\mathop {\sup }\limits_{1 \leqslant n \leqslant N} \left\| {\sum\limits_{i = 1}^n {e_i } } \right\| > \lambda } \right)$$ This result holds when the sequences are real, tangent, and either conditionally symmetric or nonnegative, or alternatively, if {d _i } is a sequence of independent random variables and {e _i } is an independent copy of {d _i }, withN a stopping time adapted to the filtration generated by {d _i } only. Other examples include Hilbert space valued differentially subordinate conditionally symmetric martingale differences. The result is true for more general operators applied to sequences as shown by an example comparing the square function of a conditionally symmetric sequence to the maximum of its absolute partial sums.     

On symmetric basic sequences in lorentz sequence spaces II

It is shown that if {y _n} is a block of type I of a symmetric basis {x _n} in a Banach spaceX, then {y _n} is equivalent to {x _n} if and only if the closed linear span [y _n] of {y _n} is complemented inX. The result is used to study the symmetric basic sequences of the dual space of a Lorentz sequence spaced(a, p). Let {x _n,f _n} be the unit vector basis ofd(a, p), for 1≤p<+∞. It is shown that every infinite-dimensional subspace ofd(a, p) (respectively, [f _n] has a complemented subspace isomorphic tol _p (respectively,l _q, 1/p+1/q=1 when 1<p<+∞ andc ₀ whenp=1) and numerous other results on complemented subspaces ofd(a, p) and [f _n] are obtained. We also obtain necessary and sufficient conditions such that [f _n] have exactly two non-equivalent symmetric basic sequences. Finally, we exhibit a Banach spaceX with symmetric basis {x _n} such that every symmetric block basic sequence of {x _n} spans a complemented subspace inX butX is not isomorphic to eitherc ₀ orl _p, 1≤p<+∞.     

On the uniqueness of symmetric bases in finite dimensional Banach spaces

Suppose{e _i} _i=1 ⁿ and{f _i} _i=1 ⁿ are symmetric bases of the Banach spacesE andF. Letd(E,F)≦C andd(E,l _n ² )≧n' for somer>0. Then there is a constantC _r=C_r(C)>0 such that for alla _i∈Ri=1,...,n $$C_r^{ - 1} \left\| {\sum\limits_{i = 1}^n {a_i e_i } } \right\| \leqq \left\| {\sum\limits_{i = 1}^n {a_i f_i } } \right\| \leqq C_r \left\| {\sum\limits_{i = 1}^n {a_i e_i } } \right\|$$ We also give a partial uniqueness of unconditional bases under more restrictive conditions.     

A class of Fibonacci-type sequences

Let {L_n:n ? 1} be a sequence of the form

where {a_j} and {b_j} are positive integers, and e=max_i,j{a_i, b_j}. A necessary and sufficient condition on the integers {a_j} and {b_j} is given so that, for all choices of positive initial values L₁, L₂,…,L_e,L_n=Σ^p_j=1L_n?aj for all large enough n.     

The combinatorics and extreme value statistics of protein threading

In protein threading, one is given a protein sequence, together with a database of protein core structures that may contain the natural structure of the sequence. The object of protein threading is to correctly identify the structure(s) corresponding to the sequence. Since the core structures are already associated with specific biological functions, threading has the potential to provide biologists with useful insights about the function of a newly discovered protein sequence. Statistical tests for threading results based on the theory of extreme values suggest several combinatorial problems. For example, what is the number of waysm′=# _t {L _i >x _i } _i ⁼⁰ⁿ of choosing a sequence {X _i } _i ⁼¹ⁿ from the set {1, 2, ...,t}, subject to the difference constraints {L _i =X _i+1?X _i >x _i } _i ⁼⁰ⁿ , whereX ₀=0,X _n+1=t+1, and {x _i } _i ⁼⁰ⁿ is an arbitrary sequence of integers? The quantitym′ has many attractive combinatorial interpretations and reduces in special continuous limits to a probabilistic formula discovered by the Finetti. Just as many important probabilities can be derived from de Finetti's formula, many interesting combinatorial quantities can be derived fromm′. Empirical results presented here show that the combinatorial approach to threading statistics appears promising, but that structural periodicities in proteins and energetically unimportant structure elements probably introduce statistical correlations that must be better understood.     

Approximation methods for common fixed points for a countable family of nonexpansive mappings

Let E=L_p or l_p space, 1<p<∞. Let K be a closed, convex and nonempty subset of E. Let be a family of nonexpansive self-mappings of K. For arbitrary fixed δ∈(0,1), define a family of nonexpansive maps by S_i?(1−δ)I+δT_i where I is the identity map of K. Let . It is proved that the iterative sequence {x_n} defined by: x₀∈K,x_n+1=α_nu+∑_i≥1σ_i,tnS_ix_n,n≥0 converges strongly to a common fixed point of the family where {α_n} and {σ_i,tn} are sequences in (0,1) satisfying appropriate conditions, in each of the following cases: (a) E=l_p,1<p<∞, and (b) E=L_p,1<p<∞ and at least one of the maps T_i’s is demicompact. Our theorems extend the results of [P. Maingé, Approximation methods for common fixed points of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 325 (2007) 469-479] from Hilbert spaces to l_p spaces, 1<p<∞.     

An explicit expression for the cost of a class of Huffman trees

Let T_n denote a binary tree with n terminal nodes V={υ₁,…,υ_n} and let l_i denote the path length from the root to υ_i. Consider a set of nonnegative numbers W={w₁,…,w_n} and for a permutation π of {1,…,n} to {1,…,n}, associate the weight w_i to the node υ_π(i). The cost of T_n is defined as C(T_n∣W)=Min_π∑ⁿ_i=1w_il_π(i).A Huffman tree H_n is a binary tree which minimizes C(T_n∣W) over all possible T_n. In this note, we give an explicit expression for C(H_n∣W) when W assumes the form: w_i=k for i=1,…,n?m; w_i=x for i=n?m+1,…,n. This simplifies and generalizes earlier results in the literature.     

One-dimensional Tilings Using Tiles with Two Gap Lengths

Let n,p,k,q,l be positive integers with n=k+l+1. Let x₁,x₂, . . . ,x_n be a sequence of positive integers with x₁<x₂<···<x_n. A set {x₁,x₂, . . . ,x_n} is called a set of type (p,k;q,l) if the set of differences {x₂–x₁,x₃–x₂, . . . ,x_n–x_n–1} equals {p, . . . ,p,q, . . . ,q} as a multiset, where p and q appear k and l times, respectively. Among other results, it is shown that for any p,k,q, there exists a finite interval I in the set of integers such that I is partitioned into sets of type (p,k;q,1).     

The inverse eigenvalue problem of reflexive matrices with a submatrix constraint and its approximation

In this paper, we first consider the existence of and the general expression for the solution to the constrained inverse eigenvalue problem defined as follows: given a generalized reflection matrix P∈R ^n×n , a set of complex n-vectors {x _i } _i=1 ^m , a set of complex numbers {λ _i } _i=1 ^m , and an s-by-s real matrix C ₀, find an n-by-n real reflexive matrix C such that the s-by-s leading principal submatrix of C is C ₀, and {x _i } _i=1 ^m and {λ _i } _i=1 ^m are the eigenvectors and eigenvalues of C, respectively. We are then concerned with the best approximation problem for the constrained inverse problem whose solution set is nonempty. That is, given an arbitrary real n-by-n matrix $\tilde{C}$ , find a matrix C which is the solution to the constrained inverse problem such that the distance between C and $\tilde{C}$ is minimized in the Frobenius norm. We give an explicit solution and a numerical algorithm to the best approximation problem. An illustrative experiment is also presented.     

Maximizing the probability of correctly ordering random variables using linear predictors

Let (T₁, x₁), (T₂, x₂), …, (T_n, x_n) be a sample from a multivariate normal distribution where T_i are (unobservable) random variables and x_i are random vectors in R^k. If the sample is either independent and identically distributed or satisfies a multivariate components of variance model, then the probability of correctly ordering {T_i} is maximized by ranking according to the order of the best linear predictors {E(T_i|x_i)}. Furthermore, it orderings are chosen according to linear functions {b′x_i} then the conditional probability of correct order given (T_i = t₁; i = 1, …, n) is maximized when b′x_i is the best linear predictor. Examples are given to show that linear predictors may not be optimal and that using a linear combination other that the best linear predictor may give a greater probability of correctly ordering {T_i} if {(T_i, x_i)} are independent but not identically distributed, or if the distributions are not normal.     

A Katona-type proof of an Erd?s-Ko-Rado-type theorem

Let p?1/2 and let μ_p be the product measure on {0,1}ⁿ, where μ_p(x)=p^∑x_i(1-p)^n-∑x_i. Let A⊂{0,1}ⁿ be an intersecting family, i.e. for every x,y∈A there exists 1?i?n such that x_i=y_i=1. Then μ_p(A)?p. Our proof uses a probabilistic trick first applied by Katona to prove the Erd?s-Ko-Rado theorem.     

On the multiplicative structure of odd perfect numbers

Starting with Euler's theorem that any odd perfect number n has the form n = p^ep_i^2e_i … p_k^2e_k, where p, p₁,…,p_k are distinct odd primes and p ≡ e ≡ 1 (mod 4), we show that extensive subsets of these numbers (so described) can be eliminated from consideration. A typical result says: if p^e, p_i^2e_i,…,p_r^2e_r are all of the prime-power divisors of such an n with p ≡ p_i ≡ 1 (mod 4), then the ordered set {e₁,…,e_r} contains an even number or odd number of odd numbers according as e ≡ pore ≡ p (mod 8).     

Eigenvalue comparisons for second order difference equations with periodic and antiperiodic boundary conditions

We consider a class of boundary value problems of the second order difference equation $$\Delta(r_{i-1}\Delta y_{i-1})-b_{i}y_{i}+\lambda a_{i}y_{i}=0,\quad 1\le i\le n,\ y_{0}=\alpha y_{n},\ y_{n+1}=\alpha y_{1}.$$ The class of problems considered includes those with antiperiodic, Dirichlet, and periodic boundary conditions. We focus on the structure of eigenvalues of this class of problems and comparisons of all eigenvalues as the coefficients {a _i } _i=1 ⁿ ,{b _i } _i=1 ⁿ , and {r _i } _i=0 ⁿ change.     

On the structure of cluster point sets of iteratively generated sequences

LetX be a closed subset of a topological spaceF; leta(·) be a continuous map fromX intoX; let {x _i} be a sequence generated iteratively bya(·) fromx ₀ inX, i.e.,x _i+1 =a(x _i),i=0, 1, 2, ...; and letQ(x ₀) be the cluster point set of {x _i}. In this paper, we prove that, if there exists a pointz inQ(x ₀) such that (i)z is isolated with respect toQ(x ₀), (ii)z is a periodic point ofa(·) of periodp, and (iii)z possesses a sequentially compact neighborhood, then (iv)Q(x ₀) containsp points, (v) the sequence {x _i} is contained in a sequentially compact set, and (vi) every point inQ(x ₀) possesses properties (i) and (ii). The application of the preceding results to the caseF=E ⁿ leads to the following: (vii) ifQ(x ₀) contains one and only one point, then {x _i} converges; (viii) ifQ(x ₀) contains a finite number of points, then {x _i} is bounded; and (ix) ifQ(x ₀) containsp points, then every point inQ(x ₀) is a periodic point ofa(·) of periodp.     

Uniform approximation on compact subsets of the real line

Let {? _i } _i=∩ ⁿ be continuous real functions on the compact set M?R. We consider the problem of best uniform approximation of the function? by polynomials \(\sum\nolimits_{i = 1}^n {c_i \varphi _i }\) on M. Let V(?₀, A) be a set of polynomials of best approximation on A ? M. We show that \(V(\varphi _0 ,M) = \mathop \cap \limits_{A_{n + 1} } V(\varphi _0 ,A_{n + 1} )\) , where A_n+1 represents all the possible sets of n+ 1 points {x₁, ..., x_n+1} in M, containing the characteristic set of the given problem of best approximation and for which the the rank of ∥?_i ∥ (i=1, ...,n; j=1,..., n+1) is equal to n. This theorem is applied to a problem of uniform approximation where {? _i } _i=1 ⁿ is a weakly Chebyshev system.     

非线性算子具误差的隐迭代程序的强收敛性

设K是一致凸Banach空间中的非空闭凸子集,T_i:K→K(i=1,2,…,N)是有限族完全渐近非扩张映象.对任意的x_0∈K,具误差的隐迭代序列{x_n}为:x_n=α_nx_n-1+β_nT_n~kx_n+γ_nu_n,n≥1,其中{α_n},{β_n},{γ_n}■[0,1]满足α_n+β_n+γ_n=1,{u_n}是K中的有界序列.在一定的条件下,该文建立了隐迭代序列{x_n}的强收敛性.得到隐迭代序列{x_n}强收敛于有限族完全渐近非扩张映象公共不动点的充要条件.所得结果改进和推广了Shahzad与Zegeye,Zhou与Chang,Chang,Tan,Lee与Chan等人的相应结果.     

On error bounds forG-stable methods

Error bounds for numerical solutions of the initial value problem $$y' = f(y), y(0) = \bar y \in R^d ,$$ are derived. The methods (?,σ) are assumed to beG-stable [2], andf satisfies for someμ teR and for some inner product 〈, 〉 the relation $$\left\langle {u - v,f(u)} \right\rangle \leqq \mu \left\| {u - v} \right\|^2 ,u,v \in R^d $$ As corollaries of the bounds we get, forμ=0, the result that whenever the local errors {q _n } ∈l ¹ then the global errors {z _n } ∈l ^∞. Forμ<0, assuming in addition that the zeros ofσ(ζ) lie inside the unit circle, {q _n } tel ^p implies {z _n } tel ^p forp ≧ 2.