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.     

Designs with no three mutually disjoint blocks

Let D(v,b,r,k,λ) be any quasi-symmetric block design with block intersection numbers 0 and y. Suppose D has no three mutually disjoint blocks. We show that for a given value of y, there are only finitely many parameter sets of such designs. Moreover, the ‘extremal’ designs D have one of the following parameter sets: (1) v = 4y, k = 2y, λ = 2y − 1 (y 2) (2) v = y(y²+3y+1), k = y(y+1), λ =y²+y−1(y2) (3) v = (y+1)(y²+2y−1), k = y(y+1), λ =y² (y2) A computer search revealed only three parameter sets in the range 1y199, which are not of the above types.     

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.     

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.     

Inverse geophysical problems for some noncompactly supported inhomogeneities

Let[²+k²n(x₁,x₃)]u(x₁,x₂,x₃)=−δ(x₁,y₁δ(x₂,y₂)δ(x₃,y₃) in R³₊. Assume that u(x₁,x₂,x₃=0,y₁,y₂=0,y₃=0,k) is measured at the plane P {x:x₃=0} for all positions of the source on the line y = (y₁,y₂ = 0,y₃ = 0), -∞ < y₁ < ∞, and receiver on the plane(x₁,x₂,x₃ − <x₁,x₂ < ∞, and for low-frequencies 0 < k <k₀, k₀ > 0 is an arbitrary small wave number. Assume thatn(x₁,x₃) is an arbitrary bounded piecewise-continuous function. The basic result is: the above low-frequency surface data determinen(x₁,x₃)uniquely.     

The k-ball l-path branch weight centroid

If x is a vertex of a tree T of radius r, if k and l are integers, if 0 k r, 0 l r, and if P is an l-path with one end at x, then define β(x; k, P) to be the number of vertices of T that are reachable from x via the l-path P and that are outside of the k-ball about x. That is, β(x;k,P) = {yεV(T):y is reachable from x via P,d(x,y) > k}. Define the k-ball l-path branch weight of x, denoted β(x;k,l), to be max {β(x;k,P):P an l-path with one end at x}, and define the k-balll-path branch weight centroid of T, denoted B(T;k,l), to be the set xεV(T): β(x;k,l) β(y;k,l), yεV(T). This two-parameter family of central sets in T includes the one-parameter family of central sets called the k-nuclei introduced by Slater (1981) which has been shown to be the one parameter family of central sets called the k-branch weight centroids by Zaw Win (1993). It also includes the one-parameter family of central sets called the k-ball branch weight centroid introduced by Reid (1991). In particular, this new family contains the classical central sets, the center and the median (which Zelinka (1968) showed is the ordinary branch weight centroid). The sets obtained for particular values of k and l are examined, and it is shown that for many values they consist of one vertex or two adjacent vertices.     

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.     

Jacobi-Sobolev-type orthogonal polynomials: Second-order differential equation and zeros

We obtain an explicit expression for the Sobolev-type orthogonal polynomials {Q_n} associated with the inner product

, where p(x) = (1 − x)(1 + x)^β is the Jacobi weight function, ,β> − 1, A₁,B₁,A₂,B₂0 and p, q P, the linear space of polynomials with real coefficients. The hypergeometric representation (₆F₅) and the second-order linear differential equation that such polynomials satisfy are also obtained. The asymptotic behaviour of such polynomials in [−1, 1] is studied. Furthermore, we obtain some estimates for the largest zero of Q_n(x). Such a zero is located outside the interval [−1, 1]. We deduce his dependence of the masses. Finally, the WKB analysis for the distribution of zeros is presented.     

A theorem of the alternatives for the equation Ax + B|x| = b

The following theorem is proved: given square matrices A, D of the same size, D nonnegative, then either the equation Ax + B|x| = b has a unique solution for each B with |B| ≤ D and for each b, or the equation Ax + B₀|x| = 0 has a nontrivial solution for some matrix B₀ of a very special form, |B₀| ≤ D; the two alternatives exclude each other. Some consequences of this result are drawn. In particular, we define a λ to be an absolute eigenvalue of A if |Ax| = λ|x| for some x ≠ 0, and we prove that each square real matrix has an absolute eigenvalue.     

Cycle decompositions of crowns

For an integer n3, the crown S_n⁰ is defined to be the graph with vertex set {x₀,x₁,…,x_n−1,y₀,y₁,…,y_n−1} and edge set {x_iy_j: 0i,jn−1, i≠j}. In this paper we give some sufficient conditions for the edge decomposition of the crown into isomorphic cycles.     

Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle

Let 1a<b be integers and G a Hamiltonian graph of order |G|(a+b)(2a+b)/b. Suppose that δ(G)a+2 and max{deg_G(x), deg_G(y)}a|G|/(a+b)+2 for each pair of nonadjacent vertices x and y in G. Then G has an [a,b]-factor which is edge-disjoint from a given Hamiltonian cycle. The lower bound on the degree condition is sharp. For the case of odd a=b, there exists a graph satisfying the conditions of the theorem but having no desired factor. As consequences, we have the degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle.     

On neighborhood condition for graphs to have [a,b]-factors

Let G be a graph of order n, and let a and b be integers such that 1a<b. Let δ(G) be the minimum degree of G. Then we prove that if δ(G)(k−1)a, n(a+b)(k(a+b)−2)/b, and |N_G(x₁)N_G(x₂)N_G(x_k)|an/(a+b) for any independent subset {x₁,x₂,…,x_k} of V(G), where k2, then G has an [a,b]-factor. This result is best possible in some sense.     

The chromatic difference sequence of the Cartesian product of graphs

The chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by cds(G) = (a(1), a(2),…, a(n)) if the sum of a(1), a(2),…, a(t) is the maximum number of vertices in an induced t-colorable subgraph of G for t = 1, 2,…, n. The Cartesian product of two graphs G and H, denoted by G□H, has the vertex set V(G□H = V(G) x V(H) and its edge set is given by (x₁, y₁)(x₂, y₂) ε E(G□H) if either x₁ = x₂ and y₁ y₂ ε E(H) or y₁ = y₂ and x₁x₂ ε E(G).

We obtained four main results: the cds of the product of bipartite graphs, the cds of the product of graphs with cds being nondrop flat and first-drop flat, the non-increasing theorem for powers of graphs and cds of powers of circulant graphs.     

Pontryagin–Thom construction for approximation of mappings by embeddings

Let n3 and be positive integers, f :Sⁿ→Sⁿ be a C⁰-mapping, and denote the standard embedding. As an application of the Pontryagin–Thom construction in the special case of the two-point configuration space, we construct complete algebraic obstructions O(f) and to discrete and isotopic realizability (realizability as an embedding) of the mapping Jf. The obstructions are described in terms of stable (equivariant) homotopy groups of neighborhoods of the singular set Σ(f)={(x,y)Sⁿ×Sⁿf(x)=f(y), x≠y}.

A standard method of solving problems in differential topology is to translate them into homotopy theory by means of bordism theory and Pontryagin–Thom construction. By this method we give a generalization of the van-Kampen–Skopenkov obstruction to discrete realizability of f and the van-Kampen–Melikhov obstruction to isotopic realizability of f. The latter are complete only in the case d=0 and are the images of our obstructions under a Hurewicz homomorphism.

We consider several examples of computation of the obstructions.     

Multiple positive solutions for one-dimensional p-Laplacian boundary value problems

By means of the Leggett-Williams fixed-point theorem, criteria are developed for the existence of at least three positive solutions to the one-dimensional p-Laplacian boundary value problem, ((y′))′ + g(t)f(t,y) = 0, y(0) - B₀(y′(0)) = 0, y(1) + B₁(y′(1)) = 0, where (v) |v|^p−2v, p > 1.     

An efficient algorithm for the parametric resource allocation problem

The parametric resource allocation problem asks to minimize the sum of separable single-variable convex functions containing a parameter λ, Σ_{i = 1}ⁿ (ƒ_i(x_i + λg_i(x_i)), under simple constraints Σ_{i = 1}ⁿ x_i = M, l_i≤x_i≤u_i and x_i: nonnegative integers for i = 1, 2, …, n, where M is a given positive integer, and l_i and u_i are given lower and upper bounds on x_i. This paper presents an efficient algorithm for computing the sequence of all optimal solutions when λ is continuously changed from 0 to ∞. The required time is O(G√Mlog² n + n log n + n log(M/n)), where G = Σ_{i = 1}ⁿ u_i − Σ_{i = 1n} l_i and an evaluation of ƒ_i(·) or g_i(·) is assumed to be done in constant time.     

Band Toeplitz preconditioners for block Toeplitz systems

We consider the solutions of block Toeplitz systems with Toeplitz blocks by the preconditioned conjugate gradient (PCG) method. Here the block Toeplitz matrices are generated by nonnegative functions f(x,y). We use band Toeplitz matrices as preconditioners. The generating functions g(x,y) of the preconditioners are trigonometric polynomials of fixed degree and are determined by minimizing (f − g)/f∞. We prove that the condition number of the preconditioned system is O(1). An a priori bound on the number of iterations for convergence is obtained.     

Orthogonal polynomials and differential equations in neutron-transport and radiative-transfer theories

There is a set of orthogonal polynomials {g_n(x)} which plays a relevant role in the treatment of the case of anisotropic scattering in neutron-transport and radiative-transfer theories. They appear also in the spherical harmonics treatment of the isotropic scattering. These polynomials are orthogonal with respect to a weight function which is continuous in the interval [−1, + 1] and has a finite number of symmetric Dirac masses. Although some other structural properties of these polynomials (e.g., the three-term recurrence relation) as well as some properties of their zeros have been published, much more need to be known. In particular, neither the second-order differential equation nor the density of zeros (i.e., the number of zeros per unit of interval) of the polynomial g_n(x) have been found. Here we obtain the second-order differential equation in the case that these polynomials are hypergeometric, so leaving open the general case. Furthermore, the exact expressions of the moments around the origin of the density of zeros of g_n(x) are given in the general case. The asymptotic density of zeros is also pointed out. Finally, these polynomials are shown to belong to the Nevai's class.     

Uniqueness implies existence for three-point boundary value problems for dynamic equations

Shooting methods are used to obtain solutions of the three-point boundary value problem for the second-order dynamic equation, y^ΔΔ = f (x, y, y^Δ), y(x₁) = y₁, y(x₃) − y(x₂) = y₂, where f : (a, b)_T × ² → is continuous, x₁ < x₂ < x₃ in (a, b)_T, y₁, y₂ ε , and T is a time scale. It is assumed such solutions are unique when they exist.     

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.