On some composite functional inequalities

The aim of the paper is to deal with the following composite functional inequalities

Sums and Differences of Two Cubic Polynomials

 When f(x) is a cubic polynomial with integral coefficients, we show that almost all integers represented as the sum or difference of two values of f(x), with , are thus represented essentially uniquely. (Received 18 January 1999; in revised form 17 May 1999)     

A comparative study of functional equations characterising sine and cosine

A comparative study of the functional equationsf(x+y)f(x–y)=f ²(x)–f ²(y),f(y){f(x+y)+f(x–y)}=f(x)f(2y) andf(x+y)+f(x–y)=2f(x){1–2f ²(y/2)} which characterise the sine function has been carried out. The zeros of the functionf satisfying any one of the above equations play a vital role in the investigations. The relation of the equationf(x+y)+f(x–y)=2f(x){1–2f ²(y/2)} with D'Alembert's equation,f(x+y)+f(x–y)=2f(x)f(y) and the sine-cosine equationg(x–y)=g(x)g(y) +f(x)f(y) has also been investigated.     

Decomposer and associative functional equations

In the previous researches [2,3] b-integer and b-decimal parts of real numbers were introduced and studied by M.H. Hooshmand. The b-parts real functions have many interesting number theoretic explanations, analytic and algebraic properties, and satisfy the functional equation f (f(x) + y - f(y)) = f(x). These functions have led him to a more general topic in semigroups and groups (even in an arbitrary set with a binary operation [4] and the following functional equations have been introduced: Associative equations:

f(xf(yz))=f(f(xy)z),f(xf(yz))=f(f(xy)z)=f(xyz)

Complete rank theorem of advanced calculus and singularities of bounded linear operators

Let E and F be Banach spaces, f: U ⊂ E → F be a map of C ^r (r ⩾ 1), x ₀ ∈ U, and ft (x ₀) denote the FréLechet differential of f at x ₀. Suppose that f′(x ₀) is double split, Rank(f′(x ₀)) = ∞, dimN(f′(_{x 0})) > 0 and codimR(f′(x ₀)) s> 0. The rank theorem in advanced calculus asks to answer what properties of f ensure that f(x) is conjugate to f′(x ₀) near x ₀. We have proved that the conclusion of the theorem is equivalent to one kind of singularities for bounded linear operators, i.e., x ₀ is a locally fine point for f′(x) or generalized regular point of f(x); so, a complete rank theorem in advanced calculus is established, i.e., a sufficient and necessary condition such that the conclusion of the theorem to be held is given.      

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.     

On the Rates of Approximation of Bernstein Type Operators

Asymptotic behavior of two Bernstein-type operators is studied in this paper. In the first case, the rate of convergence of a Bernstein operator for a bounded function f is studied at points x where f(x+) and f(x−) exist. In the second case, the rate of convergence of a Szász operator for a function f whose derivative is of bounded variation is studied at points x where f(x+) and f(x−) exist. Estimates of the rate of convergence are obtained for both cases and the estimates are the best possible for continuous points.     

On a difference equation arising in a learning-theory model

An analysis is presented of the equationf(x+a)−f(x)=e ^−x {f(x)−f(x−b)}. Herea andb denote arbitrary positive constants, and a solution is sought which satisfies the following conditions:f(−∞)=0,f(+∞)=1, 0≦f(x)≦1. Existence and uniqueness of solution are established, and then an analytical form of the solution is obtained by use of bilateral Laplace transform. Research supported by the National Science Foundation, Grant GP-2558.     

Approximate solution of differential equations with the use of asymptotic polynomials

We consider an approximate solution of differential equations with initial and boundary conditions. To find a solution, we use asymptotic polynomials Q _n ^f (x) of the first kind based on Chebyshev polynomials T _n (x) of the first kind and asymptotic polynomials G _n ^f (x) of the second kind based on Chebyshev polynomials U _n (x) of the second kind. We suggest most efficient algorithms for each of these solutions. We find classes of functions for which the approximate solution converges to the exact one. The remainder is represented as an expansion in linear functionals {L _n ^f } in the first case and {M _n ^f } in the second case, whose decay rate depends on the properties of functions describing the differential equation.     

An algorithm of MCMC method for solving F(X) =0

An algorithm of continuous stage-space MCMC method for solving algebra equation f(x)=0 is given. It is available for the case that the sign of f(x) changes frequently or the derivative f′(x) does not exist in the neighborhood of the root, while the Newton method is hard to work. Let n be the number of random variables created by computer in our algorithm. Then after m=O(n) transactions from the initial value x ₀,x* can be got such that |f(x*)|<e ^−cm |f(x ₀)| by choosing suitable positive constant c. An illustration is also given with the discussion of convergence by adjusting the parameters in the algorithm. Supported by the National Natural Science Foundation of China (70171008).     

A generalization of Ostrowski's theorem on ultrametric inequalities

Summary We first characterize all the ultrametric functionsf on (assuming both thatf(–x)=f(x) and thatf(x)=0 if and only ifx=0) and then, among these functions, we describe those satisfying the functional equationf(x)·f(x ^–1)=1, for all nonzerox in .Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

On the spectral curve for functional-difference Schrödinger equation

We suggest a method for constructing a set of finite-gap solutions for a functional-difference deformation of the Schr?dinger equation v(x)f(x +2h)+ f(x)= λf(x + h). It is shown that the edges of gaps of the corresponding spectral curve depend on x. Examples are given. Bibliography: 7 titles.     

树映射的链回归点与拓扑熵

Let f be a tree map,P(f) the set of periodic points of f and CR(f) the set of chain recurrent points of f. In this paper,the notion of division for invariant closed subsets of a tree map is introduced. It is proved that: (1) fhas zero topological entropy if and only if for any x∈CR(f)-P(f) and each natural number s the orbit of x under f^5 has a division; (2) If f has zero topological entropy,then for any xECR(f)--P(f) the w-limit set of x is an infinite minimal set.     

Generalized Hyers-Ulam Stability for a General Mixed Functional Equation in Quasi-��-normed Spaces

In this paper, we establish the general solution and investigate the generalized Hyers-Ulam stability of the following mixed additive and quadratic functional equation

A note on certain functional determinants

Summary We consider the problem when a scalar function ofn variables can be represented in the form of a determinant det(f _i (x _j )), the so-called Casorati determinant off ₁,f ₂,,f _n . The result is applied to the solution of some functional equations with unknown functionsH of two variables that involve determinants det(H(x _i ,x _j )).     

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.     

On stability of a cubic functional equation in intuitionistic fuzzy normed spaces

In this paper, we determine some stability results concerning the cubic functional equation

f(2x+y)+f(2x-y)=2f(x+y)+2f(x-y)+12f(x)

Another logarithmic functional equation

Summary. Let f : ]0,￥[? \Bbb R f :\,]0,\infty[\to \Bbb R be a real valued function on the set of positive reals. The functional equations¶¶f(x + y) - f(x) - f(y) = f(x^-1 + y^-1) f(x + y) - f(x) - f(y) = f(x^{-1} + y^{-1}) ¶and¶f(xy) = f(x) + f(y) f(xy) = f(x) + f(y) ¶are equivalent to each other.     

Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals

This paper studies the representation of a positive polynomial f(x) on a noncompact semialgebraic set S={x∈Rⁿ:g₁(x)≥0,…,g_s(x)≥0} modulo its KKT (Karush-Kuhn-Tucker) ideal. Under the assumption that the minimum value of f(x) on S is attained at some KKT point, we show that f(x) can be represented as sum of squares (SOS) of polynomials modulo the KKT ideal if f(x)>0 on S; furthermore, when the KKT ideal is radical, we argue that f(x) can be represented as a sum of squares (SOS) of polynomials modulo the KKT ideal if f(x)≥0 on S. This is a generalization of results in [J. Nie, J. Demmel, B. Sturmfels, Minimizing polynomials via sum of squares over the gradient ideal, Mathematical Programming (in press)], which discusses the SOS representations of nonnegative polynomials over gradient ideals.     

On the almost monotone convergence of sequences of continuous functions

A sequence (f _n ) _n of functions f _n : X → ℝ almost decreases (increases) to a function f: X → ℝ if it pointwise converges to f and for each point x ∈ X there is a positive integer n(x) such that f _n+1(x) ≤ f _n (x) (f _n+1(x) ≥ f _n (x)) for n ≥ n(x). In this article I investigate this convergence in some families of continuous functions.