Analytic solutions of an iterative functional differential equation

This paper is concerned with a functional differential equation x^′(z)=1/x(az+bx(z)), where a, b are two complex numbers. By constructing a convergent power series solution y(z) of a auxiliary equation of the form b²y^′(z)=(y(μ²z)−ay(μz))(μy^′(μz)−ay^′(z)), analytic solutions of the form for the original differential equation are obtained.     

On oscillation of second order neutral type delay differential equations

Oscillation criteria are obtained by using the so called H-method for the second order neutral type delay differential equations of the form

(r(t)ψ(x(t))z^′(t))^′+q(t)f(x(σ(t)))=0, tt₀,

where z(t)=x(t)+p(t)x(τ(t)), r, p, q, τ, σ, C([t₀,∞),R) and f,ψC(R,R).

The results of the paper contains several results obtained previously as special cases. Furthermore, we are also able to fix an error in a recent paper related to the oscillation of second order nonneutral delay differential equations.     

Classical and vector sturm—liouville problems: recent advances in singular-point analysis and shooting-type algorithms

Significant advances have been made in the last year or two in algorithms and theory for Sturm—Liouville problems (SLPs). For the classical regular or singular SLP −(p(x)u′)′ + q(x)u = λw(x)u, a < x < b, we outline the algorithmic approaches of the recent library codes and what they can now routinely achieve.

For a library code, automatic treatment of singular problems is a must. New results are presented which clarify the effect of various numerical methods of handling a singular endpoint.

For the vector generalization −(P(x)u′)′+Q(x)u = λW(x)u where now u is a vector function of x, and P, Q, W are matrices, and for the corresponding higher-order vector self-adjoint problem, we outline the equally impressive advances in algorithms and theory.     

The Second Neighbourhood for Quasi-transitive Oriented Graphs

In 2006, Sullivan stated the conjectures:(1) every oriented graph has a vertex x such that d~(++)(x) ≥ d~-(x);(2) every oriented graph has a vertex x such that d~(++)(x) + d~+(x) ≥ 2 d~-(x);(3) every oriented graph has a vertex x such that d~(++)(x) + d~+(x) ≥ 2 · min{d~+(x), d~-(x)}. A vertex x in D satisfying Conjecture(i) is called a Sullivan-i vertex, i = 1, 2, 3. A digraph D is called quasi-transitive if for every pair xy, yz of arcs between distinct vertices x, y, z, xz or zx("or" is inclusive here) is in D. In this paper, we prove that the conjectures hold for quasi-transitive oriented graphs, which is a superclass of tournaments and transitive acyclic digraphs. Furthermore, we show that a quasi-transitive oriented graph with no vertex of in-degree zero has at least three Sullivan-1 vertices and a quasi-transitive oriented graph has at least three Sullivan-3 vertices unless it belongs to an exceptional class of quasitransitive oriented graphs. For Sullivan-2 vertices, we show that an extended tournament, a subclass of quasi-transitive oriented graphs and a superclass of tournaments, has at least two Sullivan-2 vertices unless it belongs to an exceptional class of extended tournaments.     

On the fourth power moment of Fourier coefficients of cusp form

Let a(n)be the Fourier coefficients of a holomorphic cusp form of weightκ=2n≥12 for the full modular group and A(x)=∑_(n≤x)a(n).In this paper,we establish an asymptotic formula of the fourth power moment of A(x)and prove that ∫T1A~4(x)dx=3/(64κπ~4)s_4;2()T~(2κ)+O(T~(2κ-δ_4+ε))with δ_4=1/8,which improves the previous result.     

Oscillation criteria for second-order nonlinear differential equations with integrable coefficient

In this paper, we consider the second-order nonlinear differential equation

[a(t)|y′(t)|^σ−1y′(t)|′+q(t)f(y(t))=r(t)

where σ > 0 is a constant, a C(R, (0, ∞)), q C(R, R), f C(R, R), xf(x) > 0, f′(x) ≥ 0 for x ≠ 0. Some new sufficient conditions for the oscillation of all solutions of (*) are obtained. Several examples which dwell upon the importance of our results are also included.     

A sufficient and necessary condition for an OWA bag mapping having the self-identity

A mapping ƒ : _n=1^∞Iⁿ → I is called a bag mapping having the self-identity if for every (x₁,…,x_n) ε _i=1^∞Iⁿ we have (1) ƒ(x₁,…,x_n) = ƒ(x_i1,…,x_in) for any arrangement (i₁,…,i_n) of {1,…,n}; monotonic; (3) ƒ(x₁,…,x_n, ƒ(x₁,…,x_n)) = ƒ(x₁,…,x_n). Let {ω_i,n : I = 1,…,n;n = 1,2,…} be a family of non-negative real numbers satisfying Σ_i=1ⁿω_i,n = 1 for every n. Then one calls the mapping ƒ : _i=1^∞Iⁿ → I defined as follows an OWA bag mapping: for every (x₁,…,x_n) ε _i=1^∞Iⁿ, ƒ(x₁,…,x_n) = Σ_i=1ⁿω_i,ny_i, where y_i is the it largest element in the set {x₁,…,x_n}. In this paper, we give a sufficient and necessary condition for an OWA bag mapping having the self-identity.     

Reconstruction of infinite locally finite connected graphs

Let G be an infinite locally finite connected graph. We study the reconstructibility of G in relation to the structure of its end set . We prove that an infinite locally finite connected graph G is reconstructible if there exists a finite family (Ω_i)_0i (n2) of pairwise finitely separable subsets of such that, for all x,y,x′,y′V(G) and every isomorphism f of G−{x,y} onto G−{x′,y′} there is a permutation π of {0,…,n−1} such that for 0i<n. From this theorem we deduce, as particular consequences, that G is reconstructible if it satisfies one of the following properties: (i) G contains no end-respecting subdivision of the dyadic tree and has at least two ends of maximal order; (ii) the set of thick ends or the one of thin ends of G is finite and of cardinality greater than one. We also prove that if almost all vertices of G are cutvertices, then G is reconstructible if it contains a free end or if it has at least a vertex which is not a cutvertex.     

Multivariate normality via conditional specification

If X is a k-dimensional random vector, we denote by X_(i) the vector X with coordinate i deleted and by X_(i,j) the vector X with coordinates i and j deleted. If for each i the conditional distribution of X_i given X_(i) = x_(i) is univariate normal for each x_(i) ^K−1 and if for each i, j the conditional distribution of X_i given X_(i,j) = x_(i,j) is univariate normal for each x_(i,j) ^k−2 then it is shown that X has a classical k-variate normal distribution.     

The growth of laguerre matrix polynomials on bounded intervals

Let A be a matrix in ^r×r such that Re(z) > −1/2 for all the eigenvalues of A and let {π_n^(A,1/2) (x)} be the normalized sequence of Laguerre matrix polynomials associated with A. In this paper, it is proved that π_n^(A,1/2) (x) = O(n^(A)/2ln^r−1(n)) and π_n+1^(A,1/2) (x) − π_n^(A,1/2) (x) = O(n^((A)−1)/2ln^r−1(n)) uniformly on bounded intervals, where (A) = max{Re(z); z eigenvalue of A}.     

Recurrence of Transitive Points in Dynamical Systems with the Specification Property

Let T:X → X be a continuous map of a compact metric space X. A point x ∈ X is called Banach recurrent point if for all neighborhood V of x, {n ∈ N:Tⁿ(x) ∈ V } has positive upper Banach density. Denote by Tr(T), W(T), QW(T) and BR(T) the sets of transitive points, weakly almost periodic points, quasi-weakly almost periodic points and Banach recurrent points of (X, T). If (X, T) has the specification property, then we show that every transitive point is Banach recurrent and ∅≠W(T) ∩ Tr(T) _≠^⊂W^*(T) ∩ Tr(T) _≠^⊂ QW(T) ∩ Tr(T) _≠^⊂ BR(T) ∩ Tr(T), in which W^*(T) is a recurrent points set related to an open question posed by Zhou and Feng. Specifically the set Tr(T) ∩ W^*(T)\W(T) is residual in X. Moreover, we construct a point x ∈ BR\QW in symbol dynamical system, and demonstrate that the sets W(T), QW(T) and BR(T) of a dynamical system are all Borel sets.     

Variable step size initial value algorithm for singular perturbation problems using locally exact integration

We consider quasilinear singular perturbation problems of the form εy^″+p(x)y^′+q(x,y)=h(x),x[0,1];y(0)=,y(1)=β with a boundary layer at one end point. The original problem is reduced to an asymptotically equivalent linear first order initial-value problem (IVP). Then, a variable step size initial value algorithm is applied to solve this (IVP). The algorithm is based on the locally exact integration of quadratic linearized problem coefficients on a non-uniform mesh. Two term-recurrence relation with controlled step size is obtained. Several problems are solved to demonstrate the applicability and efficiency of the algorithm. It is observed that the present method approximates the exact solution very well.     

Matrices with zero trace as commutators of nilpotents

Let C ∈ F^n×n have minimum polynomial m(x). Suppose C is of zero trace and m(x) splits over F. Then, except when n = 2 and m(x) = (x - c)² or when n = 3 and m(x) = x - c)² with c ≠ 0, there exist nilpotents A, B ∈ F^n×n such that C = AB - BA.     

Convolution integral equations with Gegenbauer function kernel

In this paper we develop a concise and transparent approach for solving Mellin convolution equations where the convolutor is the product of an algebraic function and a Gegenbauer function. Our method is primarily based on

1. the use of fractional integral/differential operators;

2. a formula for Gegenbauer functions which is a fractional extension of the Rodrigues formula for Gegenbauer polynomials (see Theorem 3);

3. an intertwining relation concerning fractional integral/differential operators (see Theorem 1), which in the integer case reads (d/dx)²ⁿ⁺¹ = (x⁻¹ d/dx)ⁿx²ⁿ⁺¹(x⁻¹ d/dx)ⁿ⁺¹.

Thus we cover most of the known results on this type of integral equations and obtain considerable extensions. As a special illustration we present the Gegenbauer transform pair associated to the Radon transformation.     

Numerical method for solving 3D inverse scattering problems

Let q(x) L²(D), D R³ is a bounded domain, q = 0 outside D, q is real-valued. Assume that A(\Gj;\t';,\Gj;,k) A(\Gj;\t';,\Gj), the scattering amplitude, is known for all \Gj;|t',\Gj; S², S² is the unit sphere, an d a fixed k \r>0. These data determine q(x) uniquely and a numerical method is given for computing q(x).     

On the degree of regularity of some equations

In this paper we investigate the behaviour of the solutions of equations Σ_I=1ⁿ a_ix_i = b, where Σ_i=1ⁿ, a_i = 0 and b ≠ 0, with respect to colorings of the set N of positive integers. It turns out that for any b ≠ 0 there exists an 8-coloring of N, admitting no monochromatic solution of x₃ − x₂ = x₂ − x₁ + b. For this equation, for b odd and 2-colorings, only an odd-even coloring prevents a monochromatic solution. For b even and 2-colorings, always monochromatic solutions can be found, and bounds for the corresponding Rado numbers are given. If one imposes the ordering x₁ < x₂ < x₃, then there exists already a 4-coloring of N, which prevents a monochromatic solution of x₃ − x₂ = x₂ − x₁ + b, where b ε N.     

Smoothness of the gradient of weak solutions of degenerate linear equations

Let Q(x) be a nonnegative definite, symmetric matrix such that (Q(x))(1/2) is Lipschitz continuous. Given a real-valued function b(x) and a weak solution u(x) of div(Q▽u) = b, we find sufficient conditions in order that Q(1/2)▽u has some first order smoothness. Specifically, if Ω is a bounded open set in R~n, we study when the components of Q(1/2)▽u belong to the first order Sobolev space W_Q~(1,2)(Ω)defined by Sawyer and Wheeden. Alternately, we study when each of n first order Lipschitz vector field derivatives X_iu has some first order smoothness if u is a weak solution in Ω of ∑_(i=1)~n X′_iX_(iu) + b = 0.We do not assume that {X_i} is a Hormander collection of vector fields in Ω. The results signal ones for more general equations.     

A stability property of the stochastic heat equation

In this paper we consider continuity properties of a stochastic heat equation of the form ∂u(t,x)/∂t = ∂²u(t,x)/∂x² + f(u(t,x))W_x,t. We prove that the solutions of this equation depend continuously on the function f and give some new estimates for this connection.     

Full quadrature sums for pth powers of polynomials with Freud weights

In this paper, we provide a solution of the quadrature sum problem of R. Askey for a class of Freud weights. Let r> 0, b (− ∞, 2]. We establish a full quadrature sum estimate

1 p < ∞, for every polynomial P of degree at most n + rn^1/3, where W² is a Freud weight such as exp(−¦x¦), > 1, λ_jn are the Christoffel numbers, x_jn are the zeros of the orthonormal polynomials for the weight W², and C is independent of n and P. We also prove a generalisation, and that such an estimate is not possible for polynomials P of degree M = m(n) if m(n) = n + ξ_nn^1/3, where ξ_n → ∞ as n → ∞. Previous estimates could sum only over those x_jn with ¦x_jn¦ σx_1n, some fixed 0 < σ < 1.     

On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.