The optimal form of selection principles for functions of a real variable

Let T be a nonempty set of real numbers, X a metric space with metric d and X^T the set of all functions from T into X. If fX^T and n is a positive integer, we set , where the supremum is taken over all numbers a₁,…,a_n,b₁,…,b_n from T such that a₁b₁a₂b₂a_nb_n. The sequence is called the modulus of variation of f in the sense of Chanturiya. We prove the following pointwise selection principle: If a sequence of functions is such that the closure in X of the set is compact for each tT and

(∗)

then there exists a subsequence of , which converges in X pointwise on T to a function fX^T satisfying lim_n→∞ν(n,f)/n=0. We show that condition (*) is optimal (the best possible) and that all known pointwise selection theorems follow from this result (including Helly's theorem). Also, we establish several variants of the above theorem for the almost everywhere convergence and weak pointwise convergence when X is a reflexive separable Banach space.     

On a Conjecture Concerning Strong Unicity Constants

Let fC[−1, 1] be real-valued. We consider the sequence of strong unicity constants (γ_n(f))_n induced by the polynomials of best uniform approximation of f. It is proved that lim inf_n→∞ γ_n(f)=0, whenever f is not a polynomial.     

MAXIMUM TREES OF FINITE SEQUENCES

ＭＡＸＩＭＵＭＴＲＥＥＳＯＦＦＩＮＩＴＥＳＥＱＵＥＮＣＥＳ￥ＷＵＳＨＩＱＵＡＮＡｂｓｔｒａｃｔ：Ｌｅｔｎ，ｓ１，ｓ２，．．．，ｓｎｂｅｎｏｎ－ｎｅｇａｔｉｖｅｉｎｔｅｇｅｒｓａｎｄＭ（ｓ１，ｓ２，．．．，ｓｎ）＝｛（ａ１，ａ２，．．．，ａ．）｜ａｉｉ...     

The Vector QD Algorithm for Smooth Functions (f, f′)

We deal with the functionz(f(z), f′(z)) wheref(z)=∑_i0 a_izⁱ, (a_i ) with lim_i→∞ a_i+1×a_i−1/(a_i)²=q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants. A convergence result on the vector orthogonal polynomials is proved.     

Extremal property of some surfaces in n-dimensional Euclidean space

A surface Γ=(f ₁(X₁,..., x_m),...,f _n(x₁,..., x_m)) is said to be extremal if for almost all points of Γ the inequality $$\parallel a_1 f_1 (x_1 , \ldots ,x_m ) + \ldots + a_n f_n (x_1 , \ldots ,x_m )\parallel< H^{ - n - \varepsilon } ,$$ , where H=max(¦a _i¦) (i=1, 2, ..., n), has only a finite number of solutions in the integersa ₁, ...,a _n. In this note we prove, for a specific relationship between m and n and a functional condition on the functionsf ₁, ...,f _n, the extremality of a class of surfaces in n-dimensional Euclidean space.     

Rates for approximation of unbounded functions by positive linear operators

Let g_a(t) and g_b(t) be two positive, strictly convex and continuously differentiable functions on an interval (a, b) (−∞ a < b ∞), and let {L_n} be a sequence of linear positive operators, each with domain containing 1, t, g_a(t), and g_b(t). If L_n(ƒ; x) converges to ƒ(x) uniformly on a compact subset of (a, b) for the test functions ƒ(t) = 1, t, g_a(t), g_b(t), then so does every ƒ ε C(a, b) satisfying ƒ(t) = O(g_a(t)) (t → a⁺) and ƒ(t) = O(g_b(t)) (t → b⁻). We estimate the convergence rate of L_nƒ in terms of the rates for the test functions and the moduli of continuity of ƒ and ƒ′.     

On the binomial arithmetical rank

The binomial arithmetical rank of a binomial ideal I is the smallest integer s for which there exist binomials f₁,..., f_s in I such that rad (I) = rad (f₁,..., f_s). We completely determine the binomial arithmetical rank for the ideals of monomial curves in P_KⁿP_K^n. In particular we prove that, if the characteristic of the field K is zero, then bar (I(C)) = n - 1 if C is complete intersection, otherwise bar (I(C)) = n. While it is known that if the characteristic of the field K is positive, then bar (I(C)) = n - 1 always.     

Positive periodic solutions of higher-dimensional functional difference equations with a parameter

By using Krasnoselskii's fixed point theorem and upper and lower solutions method, we find some sets of positive values λ determining that there exist positive T-periodic solutions to the higher-dimensional functional difference equations of the form where A(n)=diag[a₁(n),a₂(n),…,a_m(n)], h(n)=diag[h₁(n),h₂(n),…,h_m(n)], a_j,h_j :Z→R⁺, τ :Z→Z are T -periodic, j=1,2,…,m, T1, λ>0, x :Z→R^m, f :R₊^m→R₊^m, where R₊^m={(x₁,…,x_m)^TR^m, x_j0, j=1,2,…,m}, R⁺={xR, x>0}.     

Second-order linearity of the general signed-rank statistic

Let X₁,…, X_n be i.i.d. random variables symmetric about zero. Let R_i(t) be the rank of |X_i − tn^−1/2| among |X₁ − tn^−1/2|,…, |X_n − tn^−1/2| and T_n(t) = Σ_{i = 1}ⁿφ((n + 1)⁻¹R_i(t))sign(X_i − tn^−1/2). We show that there exists a sequence of random variables V_n such that sup_{0 ≤ t ≤ 1} |T_n(t) − T_n(0) − tV_n| → 0 in probability, as n → ∞. V_n is asymptotically normal.     

Sharp inequalities for convolution-type operators

Let μ be a probability measure on [− a, a], a > 0, and let x₀ε[− a, a], f ε Cⁿ([−2a, 2a]), n 0 even. Using moment methods we derive best upper bounds to ¦∫_−a^a ([f(x₀ + y) + f(x₀ − y)]/2) μ(dy) − f(x₀)¦, leading to sharp inequalities that are attainable and involve the second modulus of continuity of f⁽ⁿ⁾ or an upper bound of it.     

A dimension theorem for division rings

LetD be a division algebra over a fieldk, letn be an arbitrary positive integer, and letk(x ₁,...,x _n) denote the rational function field inn variables overk. In this note we complete previous work by proving that the following three conditions are equivalent: (i) there exists an integerj such that the matrix ringM _j(D) contains a commutative subfield which has transcendence degreen overk; (ii) K dim (D⊗_k k(x ₁,...,x _n )) =n; (iii) gl. dim (D⊗_k k(x ₁,...,x _n )) =n. The crucial tool in the proof of this theorem is the Nullstellensatz forD[x ₁,...,x _n] which was obtained by Amitsur and Small.     

q-Bernstein polynomials and their iterates

Let B_n( f,q;x), n=1,2,… be q-Bernstein polynomials of a function f : [0,1]→C. The polynomials B_n( f,1;x) are classical Bernstein polynomials. For q≠1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: |z|<q+} the rate of convergence of {B_n( f,q;x)} to f(x) in the norm of C[0,1] has the order q⁻ⁿ (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {B_n^j_n( f,q;x)}, where both n→∞ and j_n→∞, are studied. It is shown that for q(0,1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of j_n→∞.     

On the approximate behavior of the posterior distribution for an extreme multivariate observation

The behavior of the posterior for a large observation is considered. Two basic situations are discussed; location vectors and natural parameters.Let X = (X₁, X₂, …, X_n) be an observation from a multivariate exponential distribution with that natural parameter Θ = (Θ₁, Θ₂, …, Θ_n). Let θ_x^* be the posterior mode. Sufficient conditions are presented for the distribution of Θ − θ_x^* given X = x to converge to a multivariate normal with mean vector 0 as |x| tends to infinity. These same conditions imply that E(Θ | X = x) − θ_x^* converges to the zero vector as |x| tends to infinity.The posterior for an observation X = (X₁, X₂, …, X_n is considered for a location vector Θ = (Θ₁, Θ₂, …, Θ_n) as x gets large along a path, γ, in Rⁿ. Sufficient conditions are given for the distribution of γ(t) − Θ given X = γ(t) to converge in law as t → ∞. Slightly stronger conditions ensure that γ(t) − E(Θ | X = γ(t)) converges to the mean of the limiting distribution.These basic results about the posterior mean are extended to cover other estimators. Loss functions which are convex functions of absolute error are considered. Let δ be a Bayes estimator for a loss function of this type. Generally, if the distribution of Θ − E(Θ | X = γ(t)) given X = γ(t) converges in law to a symmetric distribution as t → ∞, it is shown that δ(γ(t)) − E(Θ | X = γ(t)) → 0 as t → ∞.     

Convergence of greedy approximation for the trigonometric system

Summary We study the following nonlinear method of approximation by trigonometric polynomials in this paper. For a periodic function f we take as an approximant a trigonometric polynomial of the form G_m(f ) := ∑_kЄΛ f^(k) e ^{(i k,x)}, where ΛˆZ^d is a set of cardinality m containing the indices of the m biggest (in absolute value) Fourier coefficients f^ (k) of function f . Note that G_m(f ) gives the best m-term approximant in the L₂-norm and, therefore, for each f ЄL₂, ║f-G_m(f )║₂→0 as m →∞. It is known from previous results that in the case of p ≠2 the condition f ЄL_p does not guarantee the convergence ║f-G_m(f )║_p→0 as m →∞.. We study the following question. What conditions (in addition to f ЄL_p) provide the convergence ║f-G_m(f )║_p→0 as m →∞? In our previous paper [10] in the case 2< p ≤∞ we have found necessary and sufficient conditions on a decreasing sequence {A_n}_n=1^∞ to guarantee the L_p-convergence of {G_m(f )} for all f ЄL_p , satisfying a_n (f ) ≤A_n , where {a_n (f )} is a decreasing rearrangement of absolute values of the Fourier coefficients of f. In this paper we are looking for necessary and sufficient conditions on a sequence {M (m)} such that the conditions f ЄL_p and ║G_M(m)(f ) - G_m(f )║_p →0 as m →∞ imply ║f - G_m(f )║_p →0 as m →∞. We have found these conditions in the case when p is an even number or p = ∞.     

On Unimodular Rows over Polynomial Rings

Let A be a commutative ring and n 3 a positive integer. In this paper, we consider unimodular rows (f₁(x),..., f_n(x)) over A[x]. We prove that, if the row of the leading coefficients of f_i(x) is unimodular over A and a A, then there exists E_n(A[x]) such that (f₁(x),...,f_n(x)) = (f₁(a),...,f_n(a)). Also, if A is a Noetherian ring with finite Krull dimension and the row of leading coefficients satisfies the same condition, then we give a bound for the length of in terms of elementary transvections.Partially supported by INTAS 93–436EXT and DFG–RFBR grant No. 96–01–00092G.2000 Mathematics Subject Classification: 19A13, 19B14, 13C10, 13B25, 13F20     

On the Greatest Common Divisor of u ? 1 and v ? 1 with u and v Near S{\cal S}-units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality gcd (f(n)aⁿ+g(n), f₁(n)bⁿ+g₁(n)) < exp(ne){\rm gcd}\, (f(n)a^n+g(n), f_1(n)b^n+g_1(n)) < \exp(n\varepsilon) holds for all but finitely many positive integers n.     

An Engel condition with generalized derivations on multilinear polynomials

Let R be a prime ring with extended centroid C, g a nonzero generalized derivation of R, f (x ₁,..., x _n) a multilinear polynomial over C, I a nonzero right ideal of R. If [g(f(r ₁,..., r _n)), f(r ₁,..., r _n)] = 0, for all r ₁, ..., r _n ∈ I, then either g(x) = ax, with (a − γ)I = 0 and a suitable γ ∈ C or there exists an idempotent element e ∈ soc(RC) such that IC = eRC and one of the following holds:

On the Behaviour of Zeros of Jacobi Polynomials

Denote by x_n,k(α,β) and x_n,k(λ)=x_n,k(λ−1/2,λ−1/2) the zeros, in decreasing order, of the Jacobi polynomial P^(α,β)_n(x) and of the ultraspherical (Gegenbauer) polynomial C^λ_n(x), respectively. The monotonicity of x_n,k(α,β) as functions of α and β, α,β>−1, is investigated. Necessary conditions such that the zeros of P^(a,b)_n(x) are smaller (greater) than the zeros of P^(α,β)_n(x) are provided. A. Markov proved that x_n,k(a,b)<x_n,k(α,β) (x_n,k(a,b)>x_n,k(α,β)) for every n and each k, 1kn if a>α and b<β (a<α and b>β). We prove the converse statement of Markov's theorem. The question of how large the function f_n(λ) could be such that the products f_n(λ)x_n,k(λ), k=1,…,[n/2] are increasing functions of λ, for λ>−1/2, is also discussed. Elbert and Siafarikas proved that f_n(λ)=(λ+(2n²+1)/(4n+2))^1/2 obeys this property. We establish the sharpness of their result.     

Some Pólya-Type Irreducibility Criteria for Multivariate Polynomials

We provide irreducibility criteria for multivariate polynomials with coefficients in an arbitrary field that extend a classical result of Pólya for polynomials with integer coefficients. In particular, we provide irreducibility conditions for polynomials of the form f(X)(Y ? f ₁(X))…(Y ? f _n (X)) + g(X), with f, f ₁, ?, f _n , g univariate polynomials over an arbitrary field.     

The Parallel Simplicity of Compaction and Chaining

Given a set of values x₁, x₂,..., x_n, of which k are nonzero, the compaction problem is the problem of moving the nonzero elements into the first k consecutive memory locations. The chaining problem asks that the nonzero elements be put into a linked list. One can in addition require that the elements remain in the same order, leading to the problems of ordered compaction and ordered chaining, respectively. This paper introduces a technique involving perfect hash functions that leads to a deterministic algorithm for ordered compaction running on a CRCW PRAM in time O(log k/log log n) using n processors. A matching lower bound for unordered compaction is given. The ordered chaining problem is shown to be solvable in time O(α(k)) with n processors (where α is a functional inverse of Ackermann′s function) and unordered chaining is shown to he solvable in constant time with n processors when k < n^{1/4− ε}.