On some characterization of probability distributions in Hilbert spaces

Summary The aim of this paper is to prove the following theorem about characterization of probability distributions in Hilbert spaces:Theorem. — Let x₁, x₂, …, x_n be n (n≥3) independent random variables in the Hilbert spaceH, having their characteristic functionals f_k(t) = E[e^i(t,x _k)], (k=1, 2, …, n): let y₁=x₁ + x_n, y₂=x₂ + x_n, …, y_n−1=x_n−1 + x_n. If the characteristic functional f(t₁, t₂, …, t_n−1) of the random variables (y₁, y₂, …, y_n−1) does not vanish, then the joint distribution of (y₁, y₂, …, y_n−1) determines all the distributions of x₁, x₂, …, x_n up to change of location.     

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 .     

On exponential sums over primes in short intervals

Let Λ(n) be the von Mangoldt function, x real and y small compared with x. This paper gives a non-trivial estimate on the exponential sum over primes in short intervals S₂(x,y;a)=?_{x < n ￡ x+y}L(n)e(n² a)S_2(x,y;{\alpha})=\sum_{x < n \le x+y}\Lambda(n)e(n^2 {\alpha}) for all α ∈ [0,1] whenever x^\frac23+e ￡ y ￡ xx^{\frac{2}{3}+{\varepsilon}}\le y \le x . This result is as good as what was previously derived from the Generalized Riemann Hypothesis.     

The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs

If G is a connected graph of order n ⩾ 1, then by a hamiltonian coloring of G we mean a mapping c of V (G) into the set of all positive integers such that |c(x) − c(y)| ⩾ n − 1 − D _G (x, y) (where D _G (x, y) denotes the length of a longest x − y path in G) for all distinct x, y ∈ V (G). Let G be a connected graph. By the hamiltonian chromatic number of G we mean

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.     

On a function associated with the Bessel functions

Summary Defining the function Δn, 1,k;x(J) asΔn, 1,k;x(J)=J _n+1(x)−J _n(x)J _n+k+1(x) associated with the Bessel functionJ _n(x), we derive a series of products of Bessel functions for Δ_{n, f, k, x} (J). Whenk=1,k;x (J) becomes Turàn expression for Bessel functions. Some consequences have been pointed out.

---

Riassunto Definita la Δ_{n, f, k, x} (J) come Δ_{n, f, k, x}, (J)=J _n+1(x)J _n+k(x)-J _n(_n+k+1)(x) associata alla funzioneJ _n(x) di Bessel, si ricava una serie di prodotti di funzioni di Bessel per Δ_{n, f, k, x}, (J). 3 Quandok=1, Δ_{n, f, k, x}, (J) diventa una espressione di Turàn per le funzioni di 2 Bessel, vengono inoltre indicate alcune altre conseguenze.

     

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∈Γ.     

A note on convergent polynomials of interpolation

In this note we define a sequence {L_n(f;x)} of interpolatory polynomials based on a system x_n={x_kn, k=1,2,…n} of nodes to be a sequence of QLIP if for every f(x)∈C[−1,1], L_n(f; x) tends uniformly to f(x) and ρ_n=1+o(1) as n→∞, where ρ_n is the ratio of the number of points in x_n, at which L_n(f;x) coincides with f(x), and the degree of L_n(f;x). Two sequences of QLIP are constructed, one of which is based on a Bernstein process and the other the Freud-Sharma's construction.     

Characterization of certain classes of orthogonal polynomials related to elliptic functions

Summary In this paper we determine all orthogonal polynomials U_n(x) such that U_n(x)=x^−1/2 F _2n+1 (x ^1/2 ) and where f(t), u(t) have Taylor series expansions. Supported in part by N. S. F. grant GP-1593.     

On a problem of (0,2)-interpolation

The object in this paper is to consider the problem of existence, uniqueness, explicit representation of (0,2)-interpolation on the zeros of (1−x²)P_n−1(x)/x when n is odd, where P_n−1 denotes Legendre polynomial of degreen−1, and the problem of convergence of interpolatory polynomials.     

Note on the solution of a certain boundary-value problem

A simple algorithm is described for inverting the operatorD _x D _y (D _x andD _y here and subsequently denote partial differentiation with respect tox andy respectively) which occurs in the iterative solution of the equationD _x D _y f (x, y)=g (x, y, f, D _x f, D _x ² f,D _x D _y f, D _y ² f) when boundary values off(x,y) are given along the sides of the rectangle in thexy-plane whose corners are at the points (a,b); (a+(n+1)k,b); (a+(n+1)k,b+(n+1)h); (a,b+(n+1)h).Communication M. R. 43 of the Computation Department of the Mathematical Centre, Amsterdam.     

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.     

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

 Let D be a semicomplete multipartite digraph, with partite sets V ₁, V ₂,…, V _c, such that |V ₁|≤|V ₂|≤…≤|V _c|. Define f(D)=|V(D)|−3|V _c|+1 and . We define the irregularity i(D) of D to be max|d ⁺(x)−d ⁻(y)| over all vertices x and y of D (possibly x=y). We define the local irregularity i _l(D) of D to be max|d ⁺(x)−d ⁻(x)| over all vertices x of D and we define the global irregularity of D to be i _g(D)=max{d ⁺(x),d ⁻(x) : x∈V(D)}−min{d ⁺(y),d ⁻(y) : y∈V(D)}. In this paper we show that if i _g(D)≤g(D) or if i _l(D)≤min{f(D), g(D)} then D is Hamiltonian. We furthermore show how this implies a theorem which generalizes two results by Volkmann and solves a stated problem and a conjecture from [6]. Our result also gives support to the conjecture from [6] that all diregular c-partite tournaments (c≥4) are pancyclic, and it is used in [9], which proves this conjecture for all c≥5. Finally we show that our result in some sense is best possible, by giving an infinite class of non-Hamiltonian semicomplete multipartite digraphs, D, with i _g(D)=i(D)=i _l(D)=g(D)+?≤f(D)+1. Revised: September 17, 1998     

Weighted mean convergence of Hakopian interpolation on the disk

In this paper, we study weighted mean integral convergence of Hakopian interpolation on the unit disk D. We show that the inner product between Hakopian interpolation polynomial Hn(f;x,y) and a smooth function g(x,y) on D converges to that of f(x,y) and g(x,y) on D when n →∞, provided f(x,y) belongs to C(D) and all first partial derivatives of g(x,y) belong to the space LipαM(0 ＜α≤ 1). We further show that provided all second partial derivatives of g(x,y) also belong to the space LipαM and f(x,y) belongs to C1 (D), the inner product between the partial derivative of Hakopian interpolation polynomial (6)/(6)xHn(f;x,y) and g(x,y) on D converges to that between (6)/(6)xf(x,y) and g(x,y) on D when n →∞.     

The sum of squared logarithms inequality in arbitrary dimensions

We prove the sum of squared logarithms inequality (SSLI) which states that for nonnegative vectors x, y ∈ ℝⁿ whose elementary symmetric polynomials satisfy e_k(x) ≤ e_k(y) (for 1 ≤ k < n) and e_n(x) = e_n(y) , the inequality ∑_i(log x_i)² ≤ ∑_i(log y_i)² holds. Our proof of this inequality follows by a suitable extension to the complex plane. In particular, we show that the function f : M ⊆ ℂⁿ → ℝ with f(z) = ∑_i(log z_i)² has nonnegative partial derivatives with respect to the elementary symmetric polynomials of z. We conclude by providing applications and wider connections of the SSLI. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

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.     

Some notes on Hermite-Fejer type interpolation

Let S_n(f,x) be the Hermite-Fejér type interpolation satisfying S_n(f,x_k)=f(x_k), S′_n(f,x_k)=0, k=1,2,…,n and S_n(f,y_i)=f(y_i), j=1,2,…,m. For m=0, let H_n(f,x)≔S_n(f,x). This paper investigates relationship between S_n(f,x) and H_n(f,x), as well as, the saturation of S_n(f,x).     

Equations fonctionnelles et estimations de normes de matrices

We solve independently the equations 1/θ(x)θ(y)=ψ(x)−ψ(y)+φ(x−y)/θ(x−y) and 1/θ(x)θ(y)=σ(x)−σ(y)/θ(x−y)+τ(x)τ(y), τ(0)=0. In both cases we find θ²=aθ⁴+bθ²+c. We deduce estimates for the spectral radius of a matrix of type(1/θ(x _r −x _s )) (the accent meaning that the coefficients of the main diagonal are zero) and we study the case where thex _r are equidistant.

Dédié to à Monsieur le Professeur Otto Haupt à l'occasion de son cententiare avec les meilleurs voeux