Wavelet Estimation in Heteroscedastic Model Under Censored Samples

Consider the heteroscedastic regression model Yi = g（xi） ＋ σiei, 1 ≤ i ≤ n, where σi^2 = f（ui）, here （xi, ui） being fixed design points, g and f being unknown functions defined on [0, 1], ei being independent random errors with mean zero. Assuming that Yi are censored randomly and the censored distribution function is known or unknown, we discuss the rates of strong uniformly convergence for wavelet estimators of g and f, respectively. Also, the asymptotic normality for the wavelet estimators of g is investigated.     

Existence of subgraph with orthogonal (g,f)-factorization

Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F ₁,F ₂,⃛,F ₁| ofG, if |E(H)∩E(F ₁)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G). Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.     

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.      

On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels

A vertex labeling f : V → Z2 of a simple graph G = (V, E) induces two edge labelings f+ , f*: E → Z2 defined by f+ (uv) = f(u)+f(v) and f*(uv) = f(u)f(v). For each i∈Z2 , let vf(i) = |{v ∈ V : f(v) = i}|, e+f(i) = |{e ∈ E : f+(e) = i}| and e*f(i)=|{e∈E:f*(e)=i}|. We call f friendly if |vf(0)-vf(1)|≤ 1. The friendly index set and the product-cordial index set of G are defined as the sets{|e+f(0)-e+f(1)|:f is friendly} and {|e*f(0)-e*f(1)| : f is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel graphs.     

All idempotent hypersubstitutions of type (2,2)

A hypersubstitution of type (2,2) is a map σ which takes the binary operation symbols f and g to binary terms σ(f) and σ(g). Any such σ can be inductively extended to a map on the set of all terms of type (2,2). By using this extension on the set Hyp(2,2) of all hypersubstitutions of type (2,2) a binary operation can be defined. Together with the identity hypersubstitution mapping f to f(x ₁,x ₂) and g to g(x ₁,x ₂) the set Hyp(2,2) forms a monoid. This monoid is isomorphic to the endomorphism monoid of the clone of all binary terms of type (2,2). We determine all idempotent elements of this monoid. The results can be applied to the equational theory of Universal Algebra.     

Frequency modules and nonexistence of quasi-periodic solutions of nonlinear evolution equations

This paper gives lower estimates for the frequency modules of almost periodic solutions to equations of the form , where A generates a strongly continuous semigroup in a Banach space , F(t,x) is 2π-periodic in t and continuous in (t,x), and f is almost periodic. We show that the frequency module ℳ(u) of any almost periodic mild solution u of (*) and the frequency module ℳ(f) of f satisfy the estimate e ^{2π iℳ(f)}⊂e ^{2π iℳ(u)}. If F is independent of t, then the estimate can be improved: ℳ(f)⊂ℳ(u). Applications to the nonexistence of quasi-periodic solutions are also given.     

Lp-decay rates to nonlinear diffusion waves for p-system with nonlinear damping

In this paper, we study the L ^p (2 ⩽ p ⩽ +∞) convergence rates of the solutions to the Cauchy problem of the so-called p-system with nonlinear damping. Precisely, we show that the corresponding Cauchy problem admits a unique global solution (v(x,t), u(x,t)) and such a solution tends time-asymptotically to the corresponding nonlinear diffusion wave (ῡ(x,t), ū(x,t)) governed by the classical Darcys’s law provided that the corresponding prescribed initial error function (w ₀(x), z ₀(x)) lies in (H ³ × H ²) (ℝ) and |v ₊ − v ₋| + ∥w ₀∥₃ + ∥z ₀∥₂ is sufficiently small. Furthermore, the L ^p (2 ⩽ p ⩽ +∞) convergence rates of the solutions are also obtained.     

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

For any vertex u∈V(G), let T_N(U)={u}∪{uv|uv∈E(G), v∈v(G)}∪{v∈v(G)|uv∈E(G)}and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C_f(u)={f(x)|x∈TN(U)}. For any two adjacent vertices x and y of V(G)such that C_f(x)≠C_f(y), we refer to f as a k-avsdt-coloring of G("avsdt"is the abbreviation of"adjacent-vertex-strongly- distinguishing total"). The avsdt-coloring number of G, denoted by X_(ast)(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We proveΔ(G) 1≤X_(ast)(G)≤Δ(G) 2 for any tree or unique cycle graph G.     

Existence of singular solutions of a degenerate equation in R 2

Let a₁,a₂, . . . ,a_m ∈ ℝ², 2≤f ∈ C([0,∞)), g_i ∈ C([0,∞)) be such that 0≤g_i(t)≤2 on [0,∞) ∀i=1, . . . ,m. For any p>1, we prove the existence and uniqueness of solutions of the equation u_t=Δ(logu), u>0, in satisfying and logu(x,t)/log|x|→−f(t) as |x|→∞, logu(x,t)/log|x−a_i|→−g_i(t) as |x−a_i|→0, uniformly on every compact subset of (0,T) for any i=1, . . . ,m under a mild assumption on u₀ where We also obtain similar existence and uniqueness of solutions of the above equation in bounded smooth convex domains of ℝ² with prescribed singularities at a finite number of points in the domain.     

Speed of convergence in nonparametric kernel estimation of a regression function and its derivatives

Summary The objective in nonparametric regression is to infer a functiong(x) and itspth order derivativesg ^(g)(x),p≧1 fixed, on the basis of a finite collection of pairs {x _i, g(x_i)+Z _i} _i=1 ⁿ , where the noise componentsZ _i satisfy certain modest assumptions and the domain pointsx _i are selected non-randomly. This paper exhibits a new class of kernel estimatesg _n ^(p) ,p≧0 fixed. The main theoretical results of this study are the rates of convergence obtained for mean square and strong consistency ofg _n ^(p) each of them being uniform on the (0,1).     

Functional equations on abelian groups with involution

Summary We produce complete solution formulas of selected functional equations of the formf(x +y) ±f(x + σ (ν)) = Σ _I ² =₁ g _l (x)h _l (y),x, y∈G, where the functionsf,g ₁,h ₁ to be determined are complex valued functions on an abelian groupG and where σ:G→G is an involution ofG. The special case of σ=−I encompasses classical functional equations like d’Alembert’s, Wilson’s first generalization of it, Jensen’s equation and the quadratic equation. We solve these equations, the equation for symmetric second differences in product form and similar functional equations for a general involution σ.     

Approximation of Functions of Few Variables in?High?Dimensions

Let f be a continuous function defined on Ω:=[0,1] ^N which depends on only ℓ coordinate variables, f(x₁,?,x_N)=g(x_i1,?,x_il)f(x_{1},\ldots,x_{N})=g(x_{i_{1}},\ldots,x_{i_{\ell}}). We assume that we are given m and are allowed to ask for the values of f at m points in Ω. If g is in Lip1 and the coordinates i ₁,…,i _ℓ are known to us, then by asking for the values of f at m=L ^ℓ uniformly spaced points, we could recover f to the accuracy |g|_Lip1 L ⁻¹ in the norm of C(Ω). This paper studies whether we can obtain similar results when the coordinates i ₁,…,i _ℓ are not known to us. A prototypical result of this paper is that by asking for C(ℓ)L ^ℓ (log ₂ N) adaptively chosen point values of f, we can recover f in the uniform norm to accuracy |g|_Lip1 L ⁻¹ when g∈Lip1. Similar results are proven for more general smoothness conditions on g. Results are also proven under the assumption that f can be approximated to some tolerance ε (which is not known) by functions of ℓ variables.     

Unboundedness of the large solutions of some asymmetric oscillators at resonance

In this paper, we consider the unboundedness of solutions of the following differential equation (φ_p(x′))′ + (p ? 1)[αφ_p(x⁺) ? βφ_p(x^?)] = f(x)x′ + g(x) + h(x) + e(t) where φ_p(u) = |u|^{p? 2} u, p > 1, x^± = max {±x, 0}, α and β are positive constants satisfying with m, n ∈ N and (m, n) = 1, f and g are continuous and bounded functions such that lim_x→±∞g(x) ? g(±∞) exists and h has a sublinear primitive, e(t) is 2π_p‐periodic and continuous. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Full friendly index sets of Cartesian products of two cycles

Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.     

A Generalized Cubic Functional Equation

In this paper, we determine the general solution of the functional equation f1 （2x ＋ y） ＋ f2（2x - y） = f3（x ＋ y） ＋ f4（x - y） ＋ f5（x） without assuming any regularity condition on the unknown functions f1,f2,f3, f4, f5 ： R→R. The general solution of this equation is obtained by finding the general solution of the functional equations f（2x ＋ y） ＋ f（2x - y） = g（x ＋ y） ＋ g（x - y） ＋ h（x） and f（2x ＋ y） - f（2x - y） = g（x ＋ y） - g（x - y）. The method used for solving these functional equations is elementary but exploits an important result due to Hosszfi. The solution of this functional equation can also be determined in certain type of groups using two important results due to Szekelyhidi.     

误差为鞅差序列的部分线性模型中估计的强相合性

考虑回归模型:y_i=x_{i ^β} +g(ti)+σ_ie_i ,i=1,2,...,n,其中 σ_i=f(u_i), (x_i,t_i,u_i)是固定非随机设计点列,f(^.),\ g(^.)$\ 是未知函数,β是待估参数,e_i是随机误差且关于非降σ -代数列{F_i,i≥1} 为鞅差序列.对文献[1]给出的基于f^(.)及g(^.)的一类非参数估计的β的最小二乘估计β_n和加权最小二乘估计β_n,在适当条件下证明了它们的强相合性,推广了文献[6]在e_i为iid情形下的结果.     

On the divisibility of power LCM matrices by power GCD matrices

Let S = {x ₁, ..., x _n } be a set of n distinct positive integers and e ⩾ 1 an integer. Denote the n × n power GCD (resp. power LCM) matrix on S having the e-th power of the greatest common divisor (x _i , x _j ) (resp. the e-th power of the least common multiple [x _i , x _j ]) as the (i, j)-entry of the matrix by ((x _i , x _j ) ^e ) (resp. ([x _i , x _j ] ^e )). We call the set S an odd gcd closed (resp. odd lcm closed) set if every element in S is an odd number and (x _i , x _j ) ∈ S (resp. [x _i , x _j ] ∈ S) for all 1 ⩽ i, j ⩽ n. In studying the divisibility of the power LCM and power GCD matrices, Hong conjectured in 2004 that for any integer e ⩾ 1, the n × n power GCD matrix ((x _i , x _j ) ^e ) defined on an odd-gcd-closed (resp. odd-lcm-closed) set S divides the n × n power LCM matrix ([x _i , x _j ] ^e ) defined on S in the ring M _n (ℤ) of n × n matrices over integers. In this paper, we use Hong’s method developed in his previous papers [J. Algebra 218 (1999) 216–228; 281 (2004) 1–14, Acta Arith. 111 (2004), 165–177 and J. Number Theory 113 (2005), 1–9] to investigate Hong’s conjectures. We show that the conjectures of Hong are true for n ⩽ 3 but they are both not true for n ⩾ 4. Research is partially supported by Program for New Century Excellent Talents in University, by SRF for ROCS, SEM, China and by the Lady Davis Fellowship at the Technion, Israel Research is partially supported by a UGC (HK) grant 2160210 (2003/05).     

A class of homogenization problems in the calculus of variations

We study a class of integral functionals for which the integrand f^e(x, u, ?u) is an oscillatory function of both x and u. Our method is based on the concept of Γ-convergenee. Technical difficulties arise because f^e(x, u, ?u) is not convex or equi-continuous in u with respect to e. Two somewhat different approaches, based respectively on abstract convergence theorems and the study of affine functions, are exploited together to overcome these technical difficulties. As an application, we give another proof of a homogenization result of P. L. Lions, G. Papanicolaou, and S. R. S. Varadhan for Hamilton-Jacobi equations.     

Learning Functions of Few Arbitrary Linear Parameters in High Dimensions

Let us assume that f is a continuous function defined on the unit ball of ℝ ^d , of the form f(x)=g(Ax), where A is a k×d matrix and g is a function of k variables for k≪d. We are given a budget m∈ℕ of possible point evaluations f(x _i ), i=1,…,m, of f, which we are allowed to query in order to construct a uniform approximating function. Under certain smoothness and variation assumptions on the function g, and an arbitrary choice of the matrix A, we present in this paper

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: