Two-point Taylor expansions in the asymptotic approximation of double integrals. Application to the second and fourth Appell functions

The main difficulty in Laplace's method of asymptotic expansions of double integrals is originated by a change of variables. We consider a double integral representation of the second Appell function F₂(a,b,b^′,c,c^′;x,y) and illustrate, over this example, a variant of Laplace's method which avoids that change of variables and simplifies the computations. Essentially, the method only requires a Taylor expansion of the integrand at the critical point of the phase function. We obtain in this way an asymptotic expansion of F₂(a,b,b^′,c,c^′;x,y) for large b, b^′, c and c^′. We also consider a double integral representation of the fourth Appell function F₄(a,b,c,d;x,y). We show, in this example, that this variant of Laplace's method is uniform when two or more critical points coalesce or a critical point approaches the boundary of the integration domain. We obtain in this way an asymptotic approximation of F₄(a,b,c,d;x,y) for large values of a,b,c and d. In this second example, the method requires a Taylor expansion of the integrand at two points simultaneously. For this purpose, we also investigate in this paper Taylor expansions of two-variable analytic functions with respect to two points, giving Cauchy-type formulas for the coefficients of the expansion and details about the regions of convergence.     

On the algebraic structure of Abelian integrals for a kind of perturbed cubic Hamiltonian systems

The finite generators of Abelian integral are obtained, where Γh is a family of closed ovals defined by H(x,y)=x²+y²+ax⁴+bx²y²+cy⁴=h, h∈Σ, ac(4ac−b²)≠0, Σ=(0,h₁) is the open interval on which Γh is defined, f(x,y), g(x,y) are real polynomials in x and y with degree 2n+1 (n?2). And an upper bound of the number of zeros of Abelian integral I(h) is given by its algebraic structure for a special case a>0, b=0, c=1.     

Oscillation of partial difference equations with continuous variables

In this paper, we consider the partial difference equation with continuous variables of the form P₁z(x + a, y + b) + p₂z (x + a, y) + p₃z (x, y + b) − p₄z (x, y) + P (x, y) z (x − τ, y − σ) = 0, where P ϵ C(R⁺ × R⁺, R⁺ − {0}), a, b, τ, σ are real numbers and p_i (i = 1, 2, 3, 4) are nonnegative constants. Some sufficient conditions for all solutions of this equation to be oscillatory are obtained.     

THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

A new inequality for symmetric functions

Let x_i ≥ 0, y_i ≥ 0 for i = 1,…, n; and let a_j(x) be the elementary symmetric function of n variables given by a_j(x) = ∑_{1 ≤ ii < … <ij ≤ n}x_ii … x_ij. Define the partical ordering x <y if a_j(x) ≤ a_j(y), j = 1,… n. We show that $\text{x}\text{\$}\text{?}\text{y ? x}{}^{\mathrm{\alpha }}\text{\$}\text{?}\text{y}{}^{\mathrm{\alpha }}\text{, 0}\text{\$}\text{?}\text{α ≤ 1}$, where {x^α}_i = x^α_i. We also give a necessary and sufficient condition on a function f(t) such that x <y ? f(x) <f(y). Both results depend crucially on the following: If x <y there exists a piecewise differentiable path z(t), with z_i(t) ≥ 0, such that z(0) = x, z(1) = y, and z(s) <z(t) if 0 ≤ s ≤ t ≤ 1.     

On the number of solutions to systems of Pell equations

We prove that, for positive integers a, b, c and d with c≠d, a>1, b>1, the number of simultaneous solutions in positive integers to ax²−cz²=1, by²−dz²=1 is at most two. This result is the best possible one. We prove a similar result for the system of equations x²−ay²=1, z²−bx²=1.     

On the nonvanishing of homogeneous product sums

For integer n ≥ 1 let H_n = H_n(x, y, z) = Σ_{p + q + r = n}x^py^qz^r be the homogeneous product sum of weight n on three letters x, y, z. Morgan Ward conjectured that H_n ≠ 0 for all integers n, x, y, z with n > 1 and xyz ≠ 0. In support of this conjecture he proved that H_n ≠ 0 if n is even or if n + 2 is a prime number greater than 3. This paper adds considerably more evidence in support of Ward's conjecture by showing that in many cases H_n(a, b, c)¬=0 modulo 2, 4, or 16. The parity of H_n(a, b, c) is determined in all cases and, when H_n(a, b, c) is even, further congruences are given modulo 4 or 16.     

Small deviations of series of independent positive random variables with weights close to exponential

Let ξ, ξ₀, ξ₁, ... be independent identically distributed (i.i.d.) positive random variables. The present paper is a continuation of the article [1] in which the asymptotics of probabilities of small deviations of series S = Σ _j=0 ^∞ a(j)ξ _j was studied under different assumptions on the rate of decrease of the probability ?(ξ < x) as x → 0, as well as of the coefficients a(j) ≥ 0 as j → ∞. We study the asymptotics of ?(S < x) as x → 0 under the condition that the coefficients a(j) are close to exponential. In the case when the coefficients a(j) are exponential and ?(ξ < x) ～ bx ^α as x → 0, b > 0, a > 0, the asymptotics ?(S < x) is obtained in an explicit form up to the factor x ^o(1). Originality of the approach of the present paper consists in employing the theory of delayed differential equations. This approach differs significantly from that in [1].     

Characterization of projective graphs

We denote the distance between vertices x and y of a graph by d(x, y), and p_ij(x, y) = ∥ {z : d(x, z) = i, d(y, z) = j} ∥. The (s, q, d)-projective graph is the graph having the s-dimensional subspaces of a d-dimensional vector space over GF(q) as vertex set, and two vertices x, y adjacent iff $\text{dim}\text{(x ? y) = s ? 1}$. These graphs are regular graphs. Also, there exist integers λ and μ > 4 so that μ is a perfect square, p₁₁(x, y) = λ whenever d(x, y) = 1, and p₁₁(x, y) = μ whenever d(x, y) = 2. The (s, q, d)-projective graphs where $\text{2d}\text{3}\text{≤ s < d ? 2}$ and $\text{(s, q, d) ≠ (}\text{2d}\text{3}\text{, 2, d)}$, are characterized by the above conditions together with the property that there exists an integer r satisfying certain inequalities.     

Oscillatory and asymptotic behavior of solutions of differential equations with deviating arguments

The oscillatory and asymptotic behavior of solutions of a class of nth order nonlinear differential equations, with deviating arguments, of the form (E, δ) L_nx(t) + δq(t) f(x[g₁(t)],…, x[g_m(t)]) = 0, where δ = ± 1 and L₀x(t) = x(t), L_kx(t) = a_k(t)(L_{k ? 1}x(t))^., $\text{k = 1, 2,…, n (}{}^{\mathrm{.}}\text{=}\text{d}\text{dt}\text{)}$, is examined. A classification of solutions of (E, δ) with respect to their behavior as t → ∞ and their oscillatory character is obtained. The comparisons of (E, 1) and (E, ?1) with first and second order equations of the form y^.(t) + c₁(t) f(y[g₁(t)],…, y[g_m(t)]) = 0 and (a_{n ? 1}(t)z^.(t))^. ? c₂(t) f(z[g₁(t)],…, z[g_m(t)]) = 0, respectively, are presented. The obtained results unify, extend and improve some of the results by Graef, Grammatikopoulos and Spikes, Philos and Staikos.     

Mapping properties for oscillatory integrals in d-dimensions

For aj,bj?1, j=1,2,…,d, we prove that the operator maps into itself for , where , and k(x,y)=φ(x,y)eig(x,y), φ(x,y) satisfies (1.2) (e.g. φ(x,y)=|x−y|^iτ,τ real) and the phase g(x,y)=xa⋅yb. We study operators with more general phases and for these operators we require that aj,bj>1, j=1,2,…,d, or al=bl?1 for some l∈{1,2,…,d}.     

Representations by quaternary quadratic forms whose coefficients are 1, 4, 9 and 36

Explicit formulae are determined for the number of representations of a positive integer by the quadratic forms ax²+by²+cz²+dt² with a,b,c,d∈{1,4,9,36}, gcd(a,b,c,d)=1 and a?b?c?d.     

Stability interval for explicit difference schemes for multi-dimensional second-order hyperbolic equations with significant first-order space derivative terms

In this piece of work, we introduce a new idea and obtain stability interval for explicit difference schemes of O(k²+h²) for one, two and three space dimensional second-order hyperbolic equations u_tt=a(x,t)u_xx+α(x,t)u_x-2η²(x,t)u,u_tt=a(x,y,t)u_xx+b(x,y,t)u_yy+α(x,y,t)u_x+β(x,y,t)u_y-2η²(x,y,t)u, and u_tt=a(x,y,z,t)u_xx+b(x,y,z,t)u_yy+c(x,y,z,t)u_zz+α(x,y,z,t)u_x+β(x,y,z,t)u_y+γ(x,y,z,t)u_z-2η²(x,y,z,t)u,0<x,y,z<1,t>0 subject to appropriate initial and Dirichlet boundary conditions, where h>0 and k>0 are grid sizes in space and time coordinates, respectively. A new idea is also introduced to obtain explicit difference schemes of O(k²) in order to obtain numerical solution of u at first time step in a different manner.     

Note on the Dočev-Grosswald asymptotic series for generalized Bessel polynomials

The Do?ev-Grosswald asymptotic series for the generalized Bessel polynomials y_n(z; a, b) is extended to O(1/n⁴) relative accuracy. The differential equation of the asymptotic factor, derived from the differential equation for y_n(z; a, b), is the basis of a different and easier method that employs simple recurrence relations and much less algebra for obtaining the same series. This is applied to the important special case of a = 1 to obtain the asymptotic series to O(1/n¹¹) relative accuracy.     

Elementary approximations for zeros of Bessel functions

Let j_vk, y_vk and c_vk denote the kth positive zeros of the Bessel functions J_v(x), Y_v(x) and of the general cylinder function C_v(x) = cos αJ_v(x)?sin αY_v(x), 0 ? α < π, respectively. In this paper we extend to c_vk, k = 2, 3,..., some linear inequalities presently known only for j_vk. In the case of the zeros y_vk we are able to extend these inequalities also to k = 1. Finally in the case of the first positive zero j_v1 we compare the linear enequalities given in [9] with some other known inequalities.     

Exponentially fitted one-step methods for the numerical solution of the scalar Riccati equation

Using stability analysis and information from the constant coefficient problem, we motivate an explicit exponentially fitted one-step method to approximate the solution of a scalar Riccati equation ϵy′ = c(x)y² + d(x)y + e(x), 0 < x ⩽ x, y(0) = y₀, where ϵ > 0 is a small parameter and the coefficients c, d and e are assumed to be real valued and continuous. An explicit Euler-type scheme is presented which, when applied to the numerical integration of the continuous problem, give solutions satisfying a uniform (in ϵ) error estimate with order one (where suitable restrictions are imposed on the coefficients c, d and e together with the choice of y(0)). Using a counterexample, we show that, for a particular class of problems, the solutions of the fitted scheme do not converge uniformly (in ϵ) to the corresponding solutions of the continuous problems. Numerical results are presented which compare the fitted scheme with a number of implicit schemes when applied to the numerical integration of some sample problems.     

Planar Graded Lattices and the <Emphasis Type="Bold">c</Emphasis><Subscript>1</Subscript>-Median Property

Let L be a lattice of finite length, ξ = (x ₁,…, x _k )∈L ^k , and y ∈ L. The remoteness r(y, ξ) of y from ξ is d(y, x ₁)+?+d(y, x _k ), where d stands for the minimum path length distance in the covering graph of L. Assume, in addition, that L is a graded planar lattice. We prove that whenever r(y, ξ) ≤ r(z, ξ) for all z ∈ L, then y ≤ x ₁∨?∨x _k . In other words, L satisfies the so-called c ₁ -median property.     

Divisibility properties of power GCD matrices and power LCM matrices

Let a,b and n be positive integers and the set S={x₁,…,x_n} of n distinct positive integers be a divisor chain (i.e. there exists a permutation σ on {1,…,n} such that x_σ(1)|…|x_σ(n)). In this paper, we show that if a|b, then the ath power GCD matrix (S^a) having the ath power (x_i,x_j)^a of the greatest common divisor of x_i and x_j as its i,j-entry divides the bth power GCD matrix (S^b) in the ring M_n(Z) of n×n matrices over integers. We show also that if a?b and n?2, then the ath power GCD matrix (S^a) does not divide the bth power GCD matrix (S^b) in the ring M_n(Z). Similar results are also established for the power LCM matrices.     

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.     

Solution of Functional Equations Related to Elliptic Functions

Functional equations of the form f(x + y)g(x ? y) = Σ _j=1 ⁿ α _j (x)β _j (y) as well as of the form f₁(x + z)f₂(y + z)f₃(x + y ? z) = Σ _j=1 ^m φ _j (x, y)ψ _j (z) are solved for unknown entire functions f, g,α _j , β _j : ? → ? and f₁, f₂, f₃, ψ _j : ? → ?, φ _j : ?² → ? in the cases of n = 3 and m = 4.