On number system constructions

We investigate various number system constructions. After summarizing earlier results we prove that for a given lattice Λ and expansive matrix M: Λ → Λ if ρ(M ⁻¹) < 1/2 then there always exists a suitable digit set D for which (Λ, M, D) is a number system. Here ρ means the spectral radius of M ⁻¹. We shall prove further that if the polynomial f(x) = c ₀ + c ₁ x + ··· + c _k x ^k ∈ Z[x], c _k = 1 satisfies the condition |c ₀| > 2 Σ _i=1 ^k |c _i | then there is a suitable digit set D for which (Z ^k , M, D) is a number system, where M is the companion matrix of f(x). The research was supported by OTKA-T043657 and Bolyai Fellowship Committee.     

On simultaneous approximation to a differentiable function and its derivative by inverse Pal-Type interpolation polynomials

Let ξ_{n −1} < ξ_{n −2} < ξ_{n − 2} < ... < ξ₁ be the zeros of the the (n−1)-th Legendre polynomial P_n−1(x) and −1=x_n<x_n−1<...<x₁=1, the zeros of the polynomial . By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C _[−1,1] ¹ , there exists a unique polynomial R_n(x) of degree 2n−2 (if n is even) satisfying conditions R_n(f, ξ_k) = f (ε_k) (1 ⩽ k ⩽ n −1); R¹ _n(f,x_k)=f¹(x_k)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {R_n(f, x)} (n is even) and the main result of this paper is that if f∈C _[1,1] ^r , r≥2, n≥r+2, and n is even then |R¹ _n(f,x)−f¹(x)|=0(1)|W_n(x)|h(x)·n^3−r·E_2n−r−3(f^(r)) holds uniformly for all x∈[−1,1], where .     

Accuracy of several multidimensional refinable distributions

Compactly supported distributions f₁,..., f_r on ℝ^d are fefinable if each f_i is a finite linear combination of the rescaled and translated distributions f_j(Ax−k), where the translates k are taken along a lattice Γ ⊂ ∝^d and A is a dilation matrix that expansively maps Γ into itself. Refinable distributions satisfy a refinement equation f(x)=Σ_k∈Λ c_k f(Ax−k), where Λ is a finite subset of Γ, the c_k are r×r matrices, and f=(f₁,...,f_r)^T. The accuracy of f is the highest degree p such that all multivariate polynomials q with degree(q)<p are exactly reproduced from linear combinations of translates of f₁,...,f_r along the lattice Γ. We determine the accuracy p from the matrices c_k. Moreover, we determine explicitly the coefficients y_α,i(k) such that x^α=Σ _i=1 ^r Σ_k∈Γy_α,i(k) fi(x+k). These coefficients are multivariate polynomials y_α,i(x) of degree |α| evaluated at lattice points k∈Γ.     

Concerning the order of approximation of periodic continuous functions by trigonometric interpolation polynomials

Letx _kn=2θk/n,k=0,1 …n−1 (n odd positive integer). LetR _n(x) be the unique trigonometric polynomial of order 2n satisfying the interpolatory conditions:R _n(x_kn)=f(x_kn),R _n ^(j)(x_kn)=0,j=1,2,4,k=0,1…,n−1. We setw ₂(t,f) as the second modulus of continuity off(x). Then we prove that |R _n(x)-f(x)|=0(nw₂(1/nf)). We also examine the question of lower estimate of ‖R _n-f‖. This generalizes an earlier work of the author.     

Orthogonal factorizations of digraphs

Let G be a digraph with vertex set V(G) and arc set E(G) and let g = (g ⁻, g ⁺) and ƒ = (ƒ ⁻, ƒ ⁺) be pairs of positive integer-valued functions defined on V(G) such that g ⁻(x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ ƒ ⁺(x) for each x ∈ V(G). A (g, ƒ)-factor of G is a spanning subdigraph H of G such that g ⁻(x) ⩽ id _H (x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ od _H (x) ⩽ ƒ ⁺(x) for each x ∈ V(H); a (g, ƒ)-factorization of G is a partition of E(G) into arc-disjoint (g, ƒ)-factors. Let = {F ₁, F ₂,…, F _m} and H be a factorization and a subdigraph of G, respectively. is called k-orthogonal to H if each F _i , 1 ⩽ i ⩽ m, has exactly k arcs in common with H. In this paper it is proved that every (mg+m−1,mƒ−m+1)-digraph has a (g, f)-factorization k-orthogonal to any given subdigraph with km arcs if k ⩽ min{g ⁻(x), g ⁺(x)} for any x ∈ V(G) and that every (mg, mf)-digraph has a (g, f)-factorization orthogonal to any given directed m-star if 0 ⩽ g(x) ⩽ f(x) for any x ∈ V(G). The results in this paper are in some sense best possible.      

Weakly Singular Integral Operators in Weighted L∞–Spaces

We study integral operators on (−1, 1) with kernels k(x, t) which may have weak singularities in (x, t) with x ∈N₁, t ∈N₂, or x=t, where N₁,N₂ are sets of measure zero. It is shown that such operators map weighted L^∞–spaces into certain weighted spaces of smooth functions, where the degree of smoothness is the higher the smoother the kernel k(x, t) as a function in x is. The spaces of smooth function are generalizations of the Ditzian-Totik spaces which are defined in terms of the errors of best weighted uniform approximation by algebraic polynomials.     

On convergence of a generalized Pál interpolation process

Let f∈C _[−1,1] ^″ (r≥1) and R_n(f,α,β,x) be the generalized Pál interpolation polynomials satisfying the conditions R_n(f,α,β,x_k)=f(x_k),R_n ^′(f,α,β,x_k)=f′(x_k)(k=1,2,…,n), where {x_k} are the roots of n-th Jacobi polynomial P_n(α,β,x),α,β>−1 and {x _k ^″ } are the roots of (1−x²)P_n″(α,β,x). In this paper, we prove that holds uniformly on [0,1]. In Memory of Professor M. T. Cheng Supported by the Science Foundation of CSBTB and the Natural Science Foundatioin of Zhejiang.     

Multiparametric estimating equations

Summary Let {p(x, θ): θ∈Θ} be a family of densities where θ=(θ₁,θ₂), being θ₁ ∈ Θ₁ ak-dimensional parameter of interest, θ₂ ∈ Θ₂ a nuisance parameter and Θ=Θ₁×Θ₂. To estimate θ₁, vector estimating equations g(x,θ₁)=(g₁(x,θ₁),...,g_k(x,θ₁))=0 are considered. The standardized form of g(x,θ₁) is defined as g_s=(E_θ(∂g/∂θ′₁))⁻¹g. Then, within the classG ₁ of unbiased equations (i.e. satisfying E_θ(g)=0 (θ∈Θ)), an equationg ^*=0 is said to be optimum if the covariance matrices ofg _s andg _s ^* are such that is non-negative definite for allg∈ G ₁ and θ∈Θ. Sufficient conditions for optimality are discussed and, in particular, conditions for the optimality of the maximum conditional likelihood equation are analyzed. Special attention is given to non-regular cases. In addition, measures of the information about θ₁ contained in an estimating equation are presented and a Rao-Blackwell theorem is given. CIENES     

Characterising the Accuracy of Multivariable Refinable Functions via the Symbol Function

Suppose that f(x) = (f ₁(x),...,f _r (x)) ^T , x∈R ^d is a vector-valued function satisfying the refinement equation f(x) = ∑_Λ c _κ f(2x−κ) with finite set Λ of Z ^d and some r×r matricex c _κ. The requirements for f to have accuracy p are given in terms of the symbol function m(ξ). Supported by NSFC     

Density of weighted wavelet frames

If ψ ∈ L²(R), Λ is a discrete subset of the affine groupA =R ⁺ ×R, and w: Λ →R ⁺ is a weight function, then the weighted wavelet system generated by ψ, Λ, and w is . In this article we define lower and upper weighted densities D _w ⁻ (Λ) and D _w ⁺ (Λ) of Λ with respect to the geometry of the affine group, and prove that there exist necessary conditions on a weighted wavelet system in order that it possesses frame bounds. Specifically, we prove that if W(ψ, Λ, w) possesses an upper frame bound, then the upper weighted density is finite. Furthermore, for the unweighted case w = 1, we prove that if W(ψ, Λ, 1) possesses a lower frame bound and D _w ⁺ (Λ⁻¹) < ∞, then the lower density is strictly positive. We apply these results to oversampled affine systems (which include the classical affine and the quasi-affine systems as special cases), to co-affine wavelet systems, and to systems consisting only of dilations, obtaining some new results relating density to the frame properties of these systems.     

Integral representation of even positive-definite functions of two variables

We obtain an integral representation of even functions of two variables for which the kernel [k ₁(x + y) + k ₂(x − y)], x, y ∈ R ², is positive definite.     

Nearly flat almost monotone measures are big pieces of lipschitz graphs

A concentrated (ξ, m) almost monotone measure inR ⁿ is a Radon measure Φ satisfying the two following conditions: (1) Θ ^m (Φ,x)≥1 for every x ∈spt (Φ) and (2) for everyx ∈R ⁿ the ratioexp [ξ(r)]r^−mΦ(B(x,r)) is increasing as a function of r>0. Here ξ is an increasing function such thatlim _r→0-ξ(r)=0. We prove that there is a relatively open dense setReg (Φ) ∋spt (Φ) such that at each x∈Reg(Φ) the support of Φ has the following regularity property: given ε>0 and λ>0 there is an m dimensional spaceW ⊂R ⁿ and a λ-Lipschitz function f from x+W into x+W^‖ so that (100-ε)% ofspt(Φ) ∩B (x, r) coincides with the graph of f, at some scale r>0 depending on x, ε, and λ.     

Measure concentration for a class of random processes

Summary.   Let X={X _i } _{i =−∞} ^∞ be a stationary random process with a countable alphabet and distribution q. Let q ^∞(·|x _{− k} ⁰) denote the conditional distribution of X ^∞=(X ₁,X ₂,…,X _n ,…) given the k-length past:

Stability of <Emphasis Type="Italic">C</Emphasis>-regularized Semigroups

Let T = (T(t))t≥0 be a bounded C-regularized semigroup generated by A on a Banach space X and R(C) be dense in X. We show that if there is a dense subspace Y of X such that for every x ∈ Y, σu(A, Cx), the set of all points λ ∈ iR to which (λ - A)^-1 Cx can not be extended holomorphically, is at most countable and σr(A) N iR = Ф, then T is stable. A stability result for the case of R(C) being non-dense is also given. Our results generalize the work on the stability of strongly continuous senfigroups.     

A descent method for submodular function minimization

We show a descent method for submodular function minimization based on an oracle for membership in base polyhedra. We assume that for any submodular function f: ?→R on a distributive lattice ?⊆2 ^V with ?,V∈? and f(?)=0 and for any vector x∈R ^V where V is a finite nonempty set, the membership oracle answers whether x belongs to the base polyhedron associated with f and that if the answer is NO, it also gives us a set Z∈? such that x(Z)>f(Z). Given a submodular function f, by invoking the membership oracle O(|V|²) times, the descent method finds a sequence of subsets Z ₁,Z ₂,···,Z _k of V such that f(Z ₁)>f(Z ₂)>···>f(Z _k )=min{f(Y) | Y∈?}, where k is O(|V|²). The method furnishes an alternative framework for submodular function minimization if combined with possible efficient membership algorithms. Received: September 9, 2001 / Accepted: October 15, 2001?Published online December 6, 2001     

On convolution powers on semidirect products

LetK be a compact group of linear operators of thed-dimensional spaceR ^d andG _K,d denote the semidirect productK byR ^d . It is shown that if an adapted probability measureμ onG _K,d is not scattered (i.e. for some compactF we havex ₀ ∈ R ^d (gF)>0), then there exists a nonzero vectorx ₀ ∈R ^d such thatk ₁(x ₀)=k ₂(x ₀) holds for all (k ₁,x ₁) and (k ₂,x ₂) belonging to the topological supportS(μ) of the measureμ. As a result we obtain that every adapted and strictly aperiodic probability measure on the group of all rigid motions of thed-dimensional Euclidian space is scattered. I thank the Foundation for Research Development for financial support.     

On pair correlations and Hausdorff dimension

We consider a system of “generalised linear forms” defined at a point x = (x _{(i, j)}) in a subset of R ^d by

Asymptotic behavior of solutions for a class of retarded difference equations

Consider the retarded difference equationx _n −x _n−1 =F(−f(x _n )+g(x _n−k )), wherek is a positive integer,F,f,g:R→R are continuous,F andf are increasing onR, anduF(u)>0 for allu≠0. We show that whenf(y)≥g(y) (resp. f(y)≤g(y)) fory∈R, every solution of (*) tends to either a constant or −∞ (resp. ∞) asn→∞. Furthermore, iff(y)≡g(y) fory∈R, then every solution of (*) tends to a constant asn→∞. Project supported by NNSF (19601016) of China and NSF (97-37-42) of Hunan     

Power cocentralizing generalized derivations on prime rings

Let R be a prime ring, U the Utumi quotient ring of R, C = Z(U) the extended centroid of R, L a non-central Lie ideal of R, H and G non-zero generalized derivations of R. Suppose that there exists an integer n ≥ 1 such that (H(u)u − uG(u)) ⁿ = 0, for all u ∈ L, then one of the following holds: (1) there exists c ∈ U such that H(x) = xc, G(x) = cx; (2) R satisfies the standard identity s ₄ and char (R) = 2; (3) R satisfies s ₄ and there exist a, b, c ∈ U, such that H(x) = ax+xc, G(x) = cx+xb and (a − b) ⁿ = 0.     

Tiling Transitive Tournaments and Their Blow-ups

Let TT _k denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT _k by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c ₂=1/2, c ₃=5/6 and c _k =1−2^{−k−log k} for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c _k n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c _k cannot be improved to less than 1−2^{−0.5k(1+o(1))}. This revised version was published online in June 2006 with corrections to the Cover Date.