Algebraic Approaches to Periodic Arithmetical Maps

A residue class a + n with weight λ is denoted by λ, a, n. For a finite system = {λ_s, a_s, n_s}^k_{s = 1} of such triples, the periodic map w (x) = ∑_{ns|x − as} λ_s is called the covering map of . Some interesting identities for those with a fixed covering map have been known; in this paper we mainly determine all those functions f : Ω → such that ∑^k_{s = 1} λ_sf(a_s + n_s ) depends only on w where Ω denotes the family of all residue classes. We also study algebraic structures related to such maps f, and periods of arithmetical functions ψ(x) = ∑^k_{s = 1} λ_se^2πia_sx/n_s and ω(x) = |{1 ≤ s ≤ k : (x + a_s, n_s) = 1}|.     

Admissibility of the natural estimator of the mean of a Gaussian process

Let {X(t): t [a, b]} be a Gaussian process with mean μ L₂[a, b] and continuous covariance K(s, t). When estimating μ under the loss ∫_a^b ( (t)−μ(t))² dt the natural estimator X is admissible if K is unknown. If K is known, X is minimax with risk ∫_a^b K(t, t) dt and admissible if and only if the three by three matrix whose entries are K(t_i, t_j) has a determinant which vanishes identically in t_i [a, b], i = 1, 2, 3.     

On the Rate of Almost Everywhere Convergence of Certain Classical Integral Means

The main purpose of this article is to establish nearly optimal results concerning the rate of almost everywhere convergence of the Gauss–Weierstrass, Abel–Poisson, and Bochner–Riesz means of the one-dimensional Fourier integral. A typical result for these means is the following: If the function f belongs to the Besov spaceB^s_{p, p}, 1<p<∞, 0<s<1, thenT_mtf (x)−f(x)=o_x(t^s) a.e. ast→0+.     

An inverse polynomial method for the identification of the leading coefficient in the Sturm–Liouville operator from boundary measurements

An inverse polynomial method of determining the unknown leading coefficient k=k(x) of the linear Sturm–Liouville operator Au=−(k(x)u^′(x))^′+q(x)u(x), x(0,1), is presented. As an additional condition only two measured data at the boundary (x=0,x=1) are used. In absence of a singular point (u^′(x)≠0,u^″(x)≠0,x[0,1]) the inverse problem is classified as a well-conditioned . If there exists at least one singular point, then the inverse problem is classified as moderately ill-conditioned (u^′(x₀)=0,x₀(0,1);u^′(x)≠0,x≠x₀;u^″(x)≠0,x[0,1]) and severely ill-conditioned (u^′(x₀)=u^″(x₀)=0,x₀(0,1);u^′(x)≠0,u^″(x)≠0,x≠x₀). For each of the cases direct problem solution is approximated by corresponding polynomials and the inverse problem is reformulated as a Cauchy problem for to the first order differential equation with respect the unknown function k=k(x). An approximate analytical solution of the each Cauchy problems are derived in explicit form. Numerical simulations all the above cases are given for noise free and noisy data. An accuracy of the presented approach is demonstrated on numerical test solutions.     

Asymptotic forms of solutions of certain linear ordinary differential equations

We analyze the asymptotic behavior as x → ∞ of the product integral Π_x0^xe^A(s)ds, where A(s) is a perturbation of a diagonal matrix function by an integrable function on [x₀,∞). Our results give information concerning the asymptotic behavior of solutions of certain linear ordinary differential equations, e.g., the second order equation y″ = a(x)y.     

Existence of vector minimizers for nonconvex 1-dim integrals with almost convex Lagrangian

This paper proves new results of existence of minimizers for the nonconvex integral , among the AC functions with x(a)=A, x(b)=B. Our Lagrangian L() is e.g. lsc with superlinear growth, assuming +∞ values freely. We replace convexity by almost convexity, a hypothesis which in the radial superlinear case L(s,ξ)=f(s,|ξ|) is automatically satisfied provided f(s,) is convex at zero.     

Reciprocal polynomials with all zeros on the unit circle

Let f(x)=a _d x ^d +a _d−1 x ^d−1+⋅⋅⋅+a ₀∈ℝ[x] be a reciprocal polynomial of degree d. We prove that if the coefficient vector (a _d ,a _d−1,…,a ₀) or (a _d−1,a _d−2,…,a ₁) is close enough, in the l ¹-distance, to the constant vector (b,b,…,b)∈ℝ ^d+1 or ℝ ^d−1, then all of its zeros have moduli 1.     

Uniqueness of solutions of boundary-value problems for operator-differential equations on a finite segment and on a semiaxis

For the equationL ₀ x(t)+L ₁x(t)+...+L _n x ⁽ⁿ⁾(t)=O, whereL _k,k=0,1,...,n, are operators acting in a Banach space, we establish criteria for an arbitrary solutionx(t) to be zero provided that the following conditions are satisfied:x ^(1–1) (a)=0, 1=1, ..., p, andx ^(1–1) (b)=0, 1=1,...,q, for - <a< b< (the case of a finite segment) orx ^(1–1) (a)=0, 1=1,...,p, under the assumption that a solutionx(t) is summable on the semiaxista with its firstn derivatives.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 279–292, March, 1994.This research was supported by the Ukrainian State Committee on Science and Technology.     

Rado Numbers fora(x+y)=bz

In the case of existence the smallest numberN=Ra_kis called a Rado number if it is guaranteed that anyk-coloring of the numbers 1, 2, …, Ncontains a monochromatic solution of a given system of linear equations. We will determine Ra_k(a, b) for the equationa(x+y)=bzifb=2 andb=a+1. Also, the case of monochromatic sequences {x_n} generated bya(x_n+x_n+1)=bx_n+2 is discussed.     

Periodic and Homoclinic Solutions of Extended Fisher–Kolmogorov Equations

In this paper we study the existence of periodic solutions of the fourth-order equations u^iv − pu″ − a(x)u + b(x)u³ = 0 and u^iv − pu″ + a(x)u − b(x)u³ = 0, where p is a positive constant, and a(x) and b(x) are continuous positive 2L-periodic functions. The boundary value problems (P₁) and (P₂) for these equations are considered respectively with the boundary conditions u(0) = u(L) = u″(0) = u″(L) = 0. Existence of nontrivial solutions for (P₁) is proved using a minimization theorem and a multiplicity result using Clark's theorem. Existence of nontrivial solutions for (P₂) is proved using the symmetric mountain-pass theorem. We study also the homoclinic solutions for the fourth-order equation u^iv + pu″ + a(x)u − b(x)u² − c(x)u³ = 0, where p is a constant, and a(x), b(x), and c(x) are periodic functions. The mountain-pass theorem of Brezis and Nirenberg and concentration-compactness arguments are used.     

A recursive algorithm for the infinity-norm fixed point problem

We present the PFix algorithm for the fixed point problem f(x)=x on a nonempty domain [a,b], where d1, , and f is a Lipschitz continuous function with respect to the infinity norm, with constant q1. The computed approximation satisfies the residual criterion , where >0. In general, the algorithm requires no more than ∑_i=1^dsⁱ function component evaluations, where s≡max(1,log₂(||b−a||_∞/))+1. This upper bound has order as →0. For the domain [0,1]^d with <0.5 we prove a stronger result, i.e., an upper bound on the number of function component evaluations is , where r≡log₂(1/). This bound approaches as r→∞ (→0) and as d→∞. We show that when q<1 the algorithm can also compute an approximation satisfying the absolute criterion , where x^* is the unique fixed point of f. The complexity in this case resembles the complexity of the residual criterion problem, but with tolerance (1−q) instead of . We show that when q>1 the absolute criterion problem has infinite worst-case complexity when information consists of function evaluations. Finally, we report several numerical tests in which the actual number of evaluations is usually much smaller than the upper complexity bound.     

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     

On the Behaviour of Zeros of Jacobi Polynomials

Denote by x_n,k(α,β) and x_n,k(λ)=x_n,k(λ−1/2,λ−1/2) the zeros, in decreasing order, of the Jacobi polynomial P^(α,β)_n(x) and of the ultraspherical (Gegenbauer) polynomial C^λ_n(x), respectively. The monotonicity of x_n,k(α,β) as functions of α and β, α,β>−1, is investigated. Necessary conditions such that the zeros of P^(a,b)_n(x) are smaller (greater) than the zeros of P^(α,β)_n(x) are provided. A. Markov proved that x_n,k(a,b)<x_n,k(α,β) (x_n,k(a,b)>x_n,k(α,β)) for every n and each k, 1kn if a>α and b<β (a<α and b>β). We prove the converse statement of Markov's theorem. The question of how large the function f_n(λ) could be such that the products f_n(λ)x_n,k(λ), k=1,…,[n/2] are increasing functions of λ, for λ>−1/2, is also discussed. Elbert and Siafarikas proved that f_n(λ)=(λ+(2n²+1)/(4n+2))^1/2 obeys this property. We establish the sharpness of their result.     

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.     

Persistence, contractivity and global stability in logistic equations with piecewise constant delays

We establish sufficient conditions for the persistence and the contractivity of solutions and the global asymptotic stability for the positive equilibrium N^*=1/(a+∑_i=0^mb_i) of the following differential equation with piecewise constant arguments:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, ∑_i=0^mb_i>0, b_i0, i=0,1,2,…,m, and a+∑_i=0^mb_i>0. These new conditions depend on a,b₀ and ∑_i=1^mb_i, and hence these are other type conditions than those given by So and Yu (Hokkaido Math. J. 24 (1995) 269–286) and others. In particular, in the case m=0 and r(t)≡r>0, we offer necessary and sufficient conditions for the persistence and contractivity of solutions. We also investigate the following differential equation with nonlinear delay terms:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, 1−ax−g(x,x,…,x)=0 has a unique solution x^*>0 and g(x₀,x₁,…,x_m)C¹[(0,+∞)×(0,+∞)××(0,+∞)].     

Rates for approximation of unbounded functions by positive linear operators

Let g_a(t) and g_b(t) be two positive, strictly convex and continuously differentiable functions on an interval (a, b) (−∞ a < b ∞), and let {L_n} be a sequence of linear positive operators, each with domain containing 1, t, g_a(t), and g_b(t). If L_n(ƒ; x) converges to ƒ(x) uniformly on a compact subset of (a, b) for the test functions ƒ(t) = 1, t, g_a(t), g_b(t), then so does every ƒ ε C(a, b) satisfying ƒ(t) = O(g_a(t)) (t → a⁺) and ƒ(t) = O(g_b(t)) (t → b⁻). We estimate the convergence rate of L_nƒ in terms of the rates for the test functions and the moduli of continuity of ƒ and ƒ′.     

A Galerkin Approximation for the Initial-Value Problem for Linear Second-Order Differential Equations

In this paper, a Galerkin type algorithm is given for the numerical solution of L(x)=(r(t)x'(t))'-p(t)x(t)=g(t); x(a)=x_a, x'(a)=x'_a, where r (t)>f0, and Spline hat functions form the approximating basis. Using the related quadratic form, a two-step difference equation is derived for the numerical solutions. A discrete Gronwall type lemma is then used to show that the error at the node points satisfies e_k=0(h²). If e(t) is the error function on a?t?b; it is also shown (in a variety of norms) that e(t)?Ch² and e'(t)?C₁h. Test case runs are also included. A (one step) Richardson or Rhomberg type procedure is used to show that e^R_k=0(h⁴). Thus our results are comparable to Runge-Kutta with half the function evaluations.     

Triangle-free distance-regular graphs

Let Γ denote a distance-regular graph with diameter d≥3. By a parallelogram of length 3, we mean a 4-tuple xyzw consisting of vertices of Γ such that ∂(x,y)=∂(z,w)=1, ∂(x,z)=3, and ∂(x,w)=∂(y,w)=∂(y,z)=2, where ∂ denotes the path-length distance function. Assume that Γ has intersection numbers a ₁=0 and a ₂≠0. We prove that the following (i) and (ii) are equivalent. (i) Γ is Q-polynomial and contains no parallelograms of length 3; (ii) Γ has classical parameters (d,b,α,β) with b<−1. Furthermore, suppose that (i) and (ii) hold. We show that each of b(b+1)²(b+2)/c ₂, (b−2)(b−1)b(b+1)/(2+2b−c ₂) is an integer and that c ₂≤b(b+1). This upper bound for c ₂ is optimal, since the Hermitian forms graph Her₂(d) is a triangle-free distance-regular graph that satisfies c ₂=b(b+1). Work partially supported by the National Science Council of Taiwan, R.O.C.     

The Pointwise Densities of the Cantor Measure

Let be the classical middle-third Cantor set and let μ be the Cantor measure. Set s = log 2/log 3. We will determine by an explicit formula for every point x the upper and lower s-densities Θ*^s(μ , x), Θ*^s(μ , x) of the Cantor measure at the point x, in terms of the 3-adic expansion of x. We show that there exists a countable set F such that 9(Θ*^s(μ , x))^{− 1/s} + (Θ*^s(μ , x))^{− 1/s} = 16 holds for x \F. Furthermore, for μ_C almost all x, Θ*^s(μ , X) − 2 · 4^{− s} and Θ*^s(μ , x) = 4^{− s}. As an application, we will show that the s-dimensional packing measure of the middle-third Cantor set is 4^s.     

On Rado numbers for

For all integers m3 and all natural numbers a₁,a₂,…,a_m−1, let n=R(a₁,a₂,…,a_m−1) represent the least integer such that for every 2-coloring of the set {1,2,…,n} there exists a monochromatic solution to

a₁x₁+a₂x₂++a_m−1x_m−1=x_m.