Stability of Cubic and Quartic Functional Equations in Non-Archimedean Spaces

We prove generalized Hyers-Ulam–Rassias stability of the cubic functional equation f(kx+y)+f(kx?y)=k[f(x+y)+f(x?y)]+2(k ³?k)f(x) for all \(k\in \Bbb{N}\) and the quartic functional equation f(kx+y)+f(kx?y)=k ²[f(x+y)+f(x?y)]+2k ²(k ²?1)f(x)?2(k ²?1)f(y) for all \(k\in \Bbb{N}\) in non-Archimedean normed spaces.     

Quantum field theory with non-fock asymptotic fields: The existence of theS-matrix

We construct a family of relativistic-invariant generating functionasl of the form

Behavior of the Fourier–Walsh coefficients of a corrected function

We prove that, given a sequence {ak}_k=1^∞ with a_k ↓ 0 and {ak}_k=1^∞ ? l₂, reals 0 < ε < 1 and p ∈ [1, 2], and f ∈ L^p(0, 1), we can find f ∈ L^p(0, 1) with mes{f ≠ f < ε whose nonzero Fourier–Walsh coefficients c_k(f) are such that |c_k(f)| = a_k for k ∈ spec(f).     

On the monotonicity of sequences of quadrature formulae

Summary LetI(f)L(f)= _k=0 ^r ₌₀ ^vk–1 a _k f ⁽⁾(X _k ) be a quadrature formula, and let {S _n (f)} _n=1 be successive approximations of the definite integralI(f)= ₀ ¹ f(x)dx obtained by the composition ofL, i.e.,S _n(f)=L( _n ), where .We prove sufficient conditions for monotonicity of the sequence {S _n (f)} _n=1 . As particular cases the monotonicity of well-known Newton-Cotes and Gauss quadratures is shown. Finally, a recovery theorem based on the monotonicity results is presented     

The inclusion of certain classes of functions

For any sequence {N_k} with {N_k} O we find sharp theorems on the inclusion of the classes {f: f l (0, 2),e _k ⁽¹⁾ (f) = O(N_k)¦, whereE _k ⁽¹⁾ (f) is the best approximation (in L) of f by trigonometric polynomials of order no greater than k, in the classL with slowly growing and in the class Lv, 1 <v < .Translated from Matematicheskie Zametki, Vol. 20, No. 6, pp. 835–841, December, 1976.     

Multiple Wiener-Ito integrals possessing a continuous extension

LetF(W) be a Wiener functional defined byF(W)=I _n(f) whereI _n(f) denotes the multiple Wiener-Ito integral of ordern of the symmetricL ²([0, 1] ⁿ ) kernelf. We show that a necessary and sufficient condition for the existence of a continuous extension ofF, i.e. the existence of a function ø(·) from the continuous functions on [0, 1] which are zero at zero to which is continuous in the supremum norms and for which ø(W)=F(W) a.s, is that there exists a multimeasure (dt ₁,...,dt _n ) on [0, 1] ⁿ such thatf(t ₁, ...,t _n ) = ((t ₁, 1]), ..., (t _n , 1]) a.e. Lebesgue on [0, 1] ⁿ . Recall that a multimeasure (A ₁,...,A _n ) is for every fixedi and every fixedA _i,...,A_i-1, A_i+1,...,A_n a signed measure inA _i and there exists multimeasures which are not measures. It is, furthermore, shown that iff(t ₁,t ₂, ...,t _n ) = ((t ₁, 1], ..., (t _n , 1]) then all the tracesf ^(k), off exist, eachf(^k) induces ann–2k multimeasure denoted by ^(k), the following relation holds

Approximation by the Bernstein–Durrmeyer Operator on a Simplex

For the Jacobi-type Bernstein–Durrmeyer operator M _n,κ on the simplex T ^d of ℝ ^d , we proved that for f∈L ^p (W _κ ;T ^d ) with 1<p<∞,

Strengthened Moser’s conjecture, geometry of Grunsky coefficients and Fredholm eigenvalues

The Grunsky and Teichmüller norms ϰ(f) and k(f) of a holomorphic univalent function f in a finitely connected domain D ∋ ∞ with quasiconformal extension to are related by ϰ(f) ≤ k(f). In 1985, Jürgen Moser conjectured that any univalent function in the disk Δ^* = {z: |z| > 1} can be approximated locally uniformly by functions with ϰ(f) < k(f). This conjecture has been recently proved by R. Kühnau and the author. In this paper, we prove that approximation is possible in a stronger sense, namely, in the norm on the space of Schwarzian derivatives. Applications of this result to Fredholm eigenvalues are given. We also solve the old Kühnau problem on an exact lower bound in the inverse inequality estimating k(f) by ϰ(f), and in the related Ahlfors inequality. To Reiner Kühnau on his 70th birthday     

On squares in polynomial products

Let f(X) ? \mathbb Z[X]{f(X) \in \mathbb {Z}[X]} be an irreducible polynomial of degree D ≥ 2 and let N be a sufficiently large positive integer. We estimate the number of positive integers n ≤ N such that the product

On criteria of estimation of the errors of cubature formulas

The paper considers cubature formulas for calculating integrals of functions f(X), X = (x ₁, …, x _n ) which are defined on the n-dimensional unit hypercube K ⁿ = [0, 1] ⁿ and have integrable mixed derivatives of the kind \(\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)\), 0 ≤ α _j ≤ 2. We estimate the errors R[f] = \(\smallint _{K^n } \) f(X)dX ? Σ _{k = 1} ^N c _k f(X(k)) of cubature formulas (c _k > 0) as functions of the weights c _k of nodes X(k) and properties of integrable functions. The error is estimated in terms of the integrals of the derivatives of f over r-dimensional faces (r≤n) of the hypercube K ⁿ : |R(f)| ≤ \(\sum _{\alpha _j } \) G(α _j )\(\int_{K^r } {\left| {\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)} \right|} \) dX _r , where coefficients G(α _j ) are criteria which depend only on parameters c _k and X(k). We present an algorithm to calculate these criteria in the two- and n-dimensional cases. Examples are given. A particular case of the criteria is the discrepancy, and the algorithm proposed is a generalization of those used to compute the discrepancy. The results obtained can be used for optimization of cubature formulas as functions of c _k and X(k).     

Some results on the entire function sharing problem

Our main result is as follows: let f and a be two entire functions such that \(\max \{ \rho _2 (f),\rho _2 (a)\} < \tfrac{1} {2}\) . If f and f ^(k) a CM, and if ρ(a ^(k) ? a) < ρ(f ? a), then f ^(k) ? a = c(f ? a) for some nonzero constant c. This result is applied to improve a result of Gundersen and Yang.     

Regularity of solutions of Poisson’s equation in multiplier spaces

The most important result stated in this paper is to show that the solutions of the Poisson equation −Δu = f, where f ∈ (Ḣ¹(ℝ ^d ) → (Ḣ⁻¹(ℝ ^d )) is a complex-valued distribution on ℝ ^d , satisfy the regularity property D ^k u ∈ (Ḣ¹ → Ḣ⁻¹) for all k, |k| = 2. The regularity of this equation is well studied by Maz’ya and Verbitsky [12] in the case where f belongs to the class of positive Borel measures.      

Some Convergence Properties of Descent Methods

In this paper, we discuss the convergence properties of a class of descent algorithms for minimizing a continuously differentiable function f on R ⁿ without assuming that the sequence { x _k } of iterates is bounded. Under mild conditions, we prove that the limit infimum of is zero and that false convergence does not occur when f is convex. Furthermore, we discuss the convergence rate of { } and { f(x _k )} when { x _k } is unbounded and { f(x _k )} is bounded.     

Precise estimate of total deficiency of meromorphic derivatives

Let f(z) be a transcendental meromorphic function in the finite plane andk be a positive integer. Then we have . Moreover, if the order of f(z) is finite, then we also have , where δ(a, f^(k)) denotes the deficiency of the valuea with respect to f^(k) and θ(∞,f) is the ramification index of ∞ with respect tof.     

Higher order Riesz transforms associated with Bessel operators

In this paper we investigate Riesz transforms R _μ ^(k) of order k≥1 related to the Bessel operator Δ_μ f(x)=-f”(x)-((2μ+1)/x)f’(x) and extend the results of Muckenhoupt and Stein for the conjugate Hankel transform (a Riesz transform of order one). We obtain that for every k≥1, R _μ ^(k) is a principal value operator of strong type (p,p), p∈(1,∞), and weak type (1,1) with respect to the measure dλ(x)=x ^2μ+1  dx in (0,∞). We also characterize the class of weights ω on (0,∞) for which R _μ ^(k) maps L ^p (ω) into itself and L ¹(ω) into L ^1,∞(ω) boundedly. This class of weights is wider than the Muckenhoupt class of weights for the doubling measure dλ. These weighted results extend the ones obtained by Andersen and Kerman.     

Coincidence of Least Uniform Deviations of Functions from Polynomials and Rational Fractions

For a given nonincreasing vanishing sequence {a _n } _{n = 0} of nonnegative real numbers, we find necessary and sufficient conditions for a sequence {n _k } _{k = 0} to have the property that for this sequence there exists a function f continuous on the interval [0,1] and satisfying the condition that , k = 0,1,2,..., where E _n (f) and R _n,m (f) are the best uniform approximations to the function f by polynomials whose degree does not exceed n and by rational functions of the form r _n,m (x) = p _n (x)/q _m (x), respectively.     

On super vertex-graceful unicyclic graphs

A graph G with p vertices and q edges, vertex set V(G) and edge set E(G), is said to be super vertex-graceful (in short SVG), if there exists a function pair (f, f ⁺) where f is a bijection from V(G) onto P, f ⁺ is a bijection from E(G) onto Q, f ⁺((u, v)) = f(u) + f(v) for any (u, v) ∈ E(G),

The dimension of the kernel in finite and infinite intersections of starshaped sets

Summary. We establish the following Helly-type result for infinite families of starshaped sets in Define the function f on {1, 2} by f(1) = 4, f(2) = 3. Let be a fixed positive number, and let be a uniformly bounded family of compact sets in the plane. For k = 1, 2, if every f(k) (not necessarily distinct) members of intersect in a starshaped set whose kernel contains a k-dimensional neighborhood of radius , then is a starshaped set whose kernel is at least k-dimensional. The number f(k) is best in each case. In addition, we present a few results concerning the dimension of the kernel in an intersection of starshaped sets in Some of these involve finite families of sets, while others involve infinite families and make use of the Hausdorff metric.     

Sparse finite element methods for operator equations with stochastic data

Let A: V → V′ be a strongly elliptic operator on a d-dimensional manifold D (polyhedra or boundaries of polyhedra are also allowed). An operator equation Au = f with stochastic data f is considered. The goal of the computation is the mean field and higher moments of the solution. We discretize the mean field problem using a FEM with hierarchical basis and N degrees of freedom. We present a Monte-Carlo algorithm and a deterministic algorithm for the approximation of the moment for k⩾1. The key tool in both algorithms is a “sparse tensor product” space for the approximation of with O(N(log N) ^k−1) degrees of freedom, instead of N ^k degrees of freedom for the full tensor product FEM space. A sparse Monte-Carlo FEM with M samples (i.e., deterministic solver) is proved to yield approximations to with a work of O(M N(log N) ^k−1) operations. The solutions are shown to converge with the optimal rates with respect to the Finite Element degrees of freedom N and the number M of samples. The deterministic FEM is based on deterministic equations for in D ^k ⊂ ℝ^kd. Their Galerkin approximation using sparse tensor products of the FE spaces in D allows approximation of with O(N(log N) ^k−1) degrees of freedom converging at an optimal rate (up to logs). For nonlocal operators wavelet compression of the operators is used. The linear systems are solved iteratively with multilevel preconditioning. This yields an approximation for with at most O(N (log N) ^k+1) operations. This work was supported under IHP Network “Breaking Complexity” by the Swiss BBW under grant No. 02.0418     

Signed total (k, k)-domatic number of digraphs

Let D be a finite and simple digraph with vertex set V(D), and let f: V(D) → {?1, 1} be a two-valued function. If k ≥?1 is an integer and ${\sum_{x \in N^-(v)}f(x) \ge k}$ for each ${v \in V(G)}$ , where N ^?(v) consists of all vertices of D from which arcs go into v, then f is a signed total k-dominating function on D. A set {f ₁, f ₂, . . . , f _d } of signed total k-dominating functions on D with the property that ${\sum_{i=1}^df_i(x)\le k}$ for each ${x \in V(D)}$ , is called a signed total (k, k)-dominating family (of functions) on D. The maximum number of functions in a signed total (k, k)-dominating family on D is the signed total (k, k)-domatic number on D, denoted by ${d_{st}^{k}(D)}$ . In this paper we initiate the study of the signed total (k, k)-domatic number of digraphs, and we present different bounds on ${d_{st}^{k}(D)}$ . Some of our results are extensions of known properties of the signed total domatic number ${d_{st}(D)=d_{st}^{1}(D)}$ of digraphs D as well as the signed total domatic number d _st (G) of graphs G, given by Henning (Ars Combin. 79:277–288, 2006).