Superstability of the generalized orthogonality equation on restricted domains

Chmielinski has proved in the paper [4] the superstability of the generalized orthogonality equation |〈f(x), f(y)〉| = |〈x,y〉|. In this paper, we will extend the result of Chmielinski by proving a theorem: LetD _n be a suitable subset of ℝⁿ. If a function f:D _n → ℝⁿ satisfies the inequality ∥〈f(x), f(y)〉| |〈x,y〉∥ ≤ φ(x,y) for an appropriate control function φ(x, y) and for allx, y ∈ D _n, thenf satisfies the generalized orthogonality equation for anyx, y ∈ D _n.     

Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

Extensions of the measurable choice theorem by means of forcing

Using the method of forcing of set theory, we prove the following two theorems on the existence of measurable choice functions: LetT be the closed unit interval [0,1] and letm be the usual Lebesgue measure defined on the Borel subsets ofT. Theorem1. LetS⊂T×T be a Borel set such that for alltεT,S _t ^def={x|(t,x)εS} is countable and non-empty. Then there exists a countable series of Lebesgue-measurable functionsf _n: T→T such thatS _t={f_n(t)|nεω} for alltε[0,1],W _x={y|(x,y)εW} is uncountable. Then there exists a functionh:[0,1]×[0,1]→W with the following properties: (a) for each xε[0,1], the functionh(x,·) is one-one and ontoW _x and is Borel measurable; (b) for eachy, h(·, y) is Lebesgue measurable; (c) the functionh is Lebesgue measurable.     

On the Cauchy difference on normed spaces

LetX be a real linear normed space, (G, +) be a topological group, andK be a discrete normal subgroup ofG. We prove that if a continuous at a point or measurable (in the sense specified later) functionf:X →G fulfils the condition:f(x +y) -f(x) -f(y) ∈K whenever ‖x‖ = ‖y‖, then, under some additional assumptions onG,K, andX, there esists a continuous additive functionA :X →G such thatf(x) -A(x) ∈K.     

On functions with the cauchy difference bounded by a functional. III

We are going to discuss special cases of a conditional functional inequality

Asymptotic stability and instability criteria for nonautonomous systems

The classical criterion of asymptotic stability of the zero solution of equations x′ = f(t, x) is that there exists a function V (t, x), a(∥x∥) ≤ V (t, x) ≤ b(∥x∥) for some a, b ∈ K such that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) for some c ∈ K. In this paper, we prove that if V^{(m + 1)} \mathop {V}\limits^{(m + {1})} (t, x) is bounded on some set [tk − T, tk + T] × BH(tk → +∞ as k → ∞), then the condition that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) can be weakened and replaced by that [(V)\dot] \dot{V} (t, x) ≤ 0 and − (−[(V)\dot] \dot{V} (tk, x)| + − [(V)\ddot] \ddot{V} (tk, x)| + ⋯ + − V^(m) \mathop {V}\limits^{(m)} (tk, x)|) ≤ −c′(∥x∥) for some c′ ∈ K. Moreover, the author also presents a corresponding instability criterion. [1–10]     

A lower bound on the total signed domination numbers of graphs

Let G be a finite connected simple graph with a vertex set V(G)and an edge set E(G). A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1}.The weight of f is W(f)=∑_(x∈V)(G)∪E(G))f(X).For an element x∈V(G)∪E(G),we define f[x]=∑_(y∈NT[x])f(y).A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1} such that f[x]≥1 for all x∈V(G)∪E(G).The total signed domination numberγ_s~*(G)of G is the minimum weight of a total signed domination function on G. In this paper,we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values ofγ_s~*(G)when G is C_n and P_n.     

ON THE DIFFUSION PHENOMENON OF QUASILINEAR HYPERBOLICWAVES

Introduction1.1.ConsiderthefollowingquasilinearhyperbolicCauchyproblemwithlineardamping{:;;!OTt=-:i<:,;>>L06,(11)wherexER",t20,anda(.)isasmoothfunctionsatisfyinga(y)~1 O(lyl")aslyl-0,orEN.(1.2)Thepurposeofthispaperistoshowthat,atleastwhenn53,theasymptoticprofileofthesolutionu(x,t)of(l.1)isgivenbythesolutionv(x,t)ofthecorrespondingparabolicproblem{:;.t>ivj:相似文献   

Asymptotic formula for the decay of correlations in the stochastic model of planar rotators at high temperature

We consider the stochastic model of planar rotators x(t)={x_k(t), k∈Z^d}, t≥0, x_k(t)∈T¹, at high temperature. For the decay of correlations <f_A(x(0)), g_A+k(t) (x(t))>, the asymptotic formula is obtained at t→∞, k(t)→∞, k(t)∈Z^d. The basic methods we used are the spectral analysis of the Markov semigroup generator and the saddle-point method. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 112, No. 1, pp. 67–80.     

Homogenization in the scattering problem

The scattering problem is studied, which is described by the equation (-Δ _x +q(x,x/ɛ)−E)ψ = f(x), where ψ = ψ (x,ɛ) ∈ ℂ, x ℂ ℝ ^d , ɛ > 0, E > 0, the function q(x,y) is periodic with respect to y, and the function f is compactly supported. The solution satisfying radiation conditions at infinity is considered, and its asymptotic behavior as ɛ → O is described. The asymptotic behavior of the scattering amplitude of a plane wave is also considered. It is shown that in principal order both the solution and the scattering amplitude are described by the homogenized equation with potential

Oscillation of nonlinear vector differential equations

Summary Oscillation criteria are obtained for vector partial differential equations of the type Δv+b(x, v)v=0, x∈G, v∈E^m, where G is an exterior domain in E_n, and b is a continuous nonnegative valued function in G × E^m. A solution v: G→E^m is called h-oscillatory in G whenever the scalar product [v(x), h] (|h|=1) has zeros x in G with |x| arbitrarily large. It is shown that the spherical mean of [v(x), h] over a hypersphere of radius r in Eⁿ satisfies a nonlinear ordinary differential inequality. As a consequence, the main theorems give sufficient conditions on b(x, t), depending upon the dimension n, for all solutions v to be h-oscillatory in G. Entrata in Redazione il 26 giugno 1975.     

Approximation error for linear polynomial interpolation onn-simplices

LetW _n ² M be the class of functionsf: Δ _n → ℝ (when Δ _n is ann-simplex) with bounded second derivative (whose absolute value does not exceedM>0) along any direction at an arbitrary point of the simplex Δ _n . LetP _1,n (f;x) be the linear polynomial interpolatingf at the vertices of the simplex. We prove that there exists a functiong ∈ W _n ² M such that for anyf ∈W _n ² M and anyx ∈ Δ _n one has |f (x)−P ₁, _n (f;x)|≤g(x). Translated fromMatematicheskie Zametki, Vol. 60, No. 4, pp. 504–510, October, 1996. I thank Yu. N. Subbotin for posing the problem and for his attention to my work.     

On the existence and approximation of zeroes

In this paper we consider the problem of finding zeroes of a continuous functionf from a convex, compact subsetU of ℝ ⁿ to ℝ ⁿ . In the first part of the paper it is proved thatf has a computable zero iff:C ⁿ →ℝ ⁿ satisfies the nonparallel condition for any two antipodal points on bdC ⁿ, i.e. if for anyx∈bdC ⁿ ,f(x)≠αf(−x), α≥0, holds. Therefore we describe a simplicial algorithm to approximate such a zero. It is shown that generally the degree of the approximate zero depends on the number of reflection steps made by the algorithm, i.e. the number of times the algorithm switches from a face τ on bdC ⁿ to the face −τ. Therefore the index of a terminal simplex σ is defined which equals the local Brouwer degree of the function if σ is full-dimensional. In the second part of the paper the algorithm is used to generate possibly several approximate zeroes off. Two sucessive solutions may have both the same or opposite degrees, again depending on the number of reflection steps. By extendingf:U→ℝ ⁿ to a function g from a cube containingU to ℝ ⁿ , the procedure can be applied to any continuous functionf without having any information about the global and local Brouwer degrees a priori.     

On the Duality Mapping Sets in Orlicz Sequence Spaces

The criteria for the weak compactness of duality mapping sets J(x) = {f∈X* : <f, x> = ∥f∥² = ∥x∥²} in Orlicz sequence spaces endowed either with the Luxemburg norm or with the Orlicz norm are obtained. Supported by the National Natural Science Foundation of China, Grants 19901007 and 19871020     

Extension of Floquet''''s theory to nonlinear quasiperiodic differential equations

In this paper, we consider the following autonomous system of differential equations: x = Ax f(x,θ), θ = ω, where θ∈Rm, ω = (ω1,…,ωm) ∈ Rm, x ∈ Rn, A ∈ Rn×n is a constant matrix and is hyperbolic, f is a C∞ function in both variables and 2π-periodic in each component of the vector e which satisfies f = O(||x||2) as x → 0. We study the normal form of this system and prove that under some proper conditions this system can be transformed to an autonomous system: x = Ax g(x), θ = ω. Additionally, the proof of this paper naturally implies the extension of Chen's theory in the quasi-periodic case.     

Quantitative form of the Luzin <Emphasis Type="Italic">C</Emphasis>-property

We prove the following statement, which is a quantitative form of the Luzin theorem on C-property: Let (X, d, μ) be a bounded metric space with metric d and regular Borel measure μ that are related to one another by the doubling condition. Then, for any function f measurable on X, there exist a positive increasing function η ∈ Ω (η(+0) = 0 and η(t)t ^−a decreases for a certain a > 0), a nonnegative function g measurable on X, and a set E ⊂ X, μE = 0 , for which

CONVERGENCE RATE FOR ITERATES OF q-BERNSTEIN POLYNOMIALS

Recently, q-Bernstein polynomials have been intensively investigated by a number of authors. Their results show that for q ≠ 1, q-Bernstein polynomials possess of many interesting properties. In this paper, the convergence rate for iterates of both q-Bernstein polynomials and their Boolean sum are estimated. Moreover, the saturation of {Bn（., qn）} when n → ∞ and convergence rate of Bn（f,q;x） when f ∈ C^n-1 [0, 1], q → ∞ are also presented.     

Asymptotic behavior of nonexpansive mappings in normed linear spaces

LetT be a nonexpansive mapping on a normed linear spaceX. We show that there exists a linear functional.f, ‖f‖=1, such that, for allx∈X, lim_n→x f(T ⁿ x/n)=lim_n→x‖T ⁿ x/n ‖=α, where α≡inf _y∈c ‖Ty-y‖. This means, ifX is reflexive, that there is a faceF of the ball of radius α to whichT ⁿ x/n converges weakly for allx (inf_z∈f g(T ⁿ x/n-z)→0, for every linear functionalg); ifX is strictly conves as well as reflexive, the convergence is to a point; and ifX satisfies the stronger condition that its dual has Fréchet differentiable norm then the convergence is strong. Furthermore, we show that each of the foregoing conditions on X is satisfied if and only if the associated convergence property holds for all nonexpansiveT. Supported by National Science Foundation Grant MCS-79-066.     

Convergence of mock Fourier series

For certain Cantor measures μ on ℝⁿ, it was shown by Jorgensen and Pedersen that there exists an orthonormal basis of exponentialse ^2πiγ·x for λεΛ. a discrete subset of ℝⁿ called aspectrum for μ. For anyL ¹ functionf, we define coefficientsc _γ(f)=∝f(y)e ^−2πiγiy dμ(y) and form the Mock Fourier series ∑_λ∈Λ^cλ(f)e ^2πiλ·x . There is a natural sequence of finite subsets Λ_n increasing to Λ asn→∞, and we define the partial sums of the Mock Fourier series by We prove, under mild technical assumptions on μ and Λ, thats _n(f) converges uniformly tof for any continuous functionf and obtain the rate of convergence in terms of the modulus of continuity off. We also show, under somewhat stronger hypotheses, almost everywhere convergence forfεL ¹. Research supported in part by the National Science Foundation, Grant DMS-0140194.