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}.     

Modular metric spaces, I: Basic concepts

The notion of a modular is introduced as follows. A (metric) modular on a set X is a function w:(0,∞)×X×X→[0,∞] satisfying, for all x,y,z∈X, the following three properties: x=y if and only if w(λ,x,y)=0 for all λ>0; w(λ,x,y)=w(λ,y,x) for all λ>0; w(λ+μ,x,y)≤w(λ,x,z)+w(μ,y,z) for all λ,μ>0. We show that, given x₀∈X, the set X_w={x∈X:lim_λ→∞w(λ,x,x₀)=0} is a metric space with metric , called a modular space. The modular w is said to be convex if (λ,x,y)?λw(λ,x,y) is also a modular on X. In this case X_w coincides with the set of all x∈X such that w(λ,x,x₀)<∞ for some λ=λ(x)>0 and is metrizable by . Moreover, if or , then ; otherwise, the reverse inequalities hold. We develop the theory of metric spaces, generated by modulars, and extend the results by H. Nakano, J. Musielak, W. Orlicz, Ph. Turpin and others for modulars on linear spaces.     

Nonsingularity of matrices associated with classes of arithmetical functions on lcm-closed sets

Let S = {x₁, … , x_n} be a set of n distinct positive integers and f be an arithmetical function. Let [f(x_i, x_j)] denote the n × n matrix having f evaluated at the greatest common divisor (x_i, x_j) of x_i and x_j as its i, j-entry and (f[x_i, x_j]) denote the n × n matrix having f evaluated at the least common multiple [x_i, x_j] of x_i and x_j as its i, j-entry. The set S is said to be lcm-closed if [x_i, x_j] ∈ S for all 1 ? i, j ? n. For an integer x > 1, let ω(x) denote the number of distinct prime factors of x. Define ω(1) = 0. In this paper, we show that if S = {x₁, … , x_n} is an lcm-closed set satisfying , and if f is a strictly increasing (resp. decreasing) completely multiplicative function, or if f is a strictly decreasing (resp. increasing) completely multiplicative function satisfying (resp. f(p) ? p) for any prime p, then the matrix [f(x_i, x_j)] (resp. (f[x_i, x_j])) defined on S is nonsingular. By using the concept of least-type multiple introduced in [S. Hong, J. Algebra 281 (2004) 1-14], we also obtain reduced formulas for det(f(x_i, x_j)) and det(f[x_i, x_j]) when f is completely multiplicative and S is lcm-closed. We also establish several results about the nonsingularity of LCM matrices and reciprocal GCD matrices.     

Multivariate weighted renewal functions

Let (X,Y),(X₁,Y₁),(X₂,Y₂),… denote independent positive random vectors with common distribution function F(x,y)=P(X?x,Y?y) with F(x,y)<1 for all x,y. Based on the X_i and the Y_j we construct the sum sequences and respectively. For a double sequence of weighting constants {b(n,m)} we associate a weighted renewal function G(x,y) defined as . The function G(x,y) can be expressed in terms of well-known renewal quantities. The main goal of this paper is to study asymptotic properties of G(x,y). In the one-dimensional case such results have been obtained among others by Omey and Teugels [Weighted renewal functions: a hierarchical approach, Adv. in Appl. Probab. 34 (2002) 394-415.] and Alsmeyer [Some relations between harmonic renewal measures and certain first passage times, Statist. Probab. Letters 12 (1991) 19-27; On generalized renewal measures and certain first passage times, Ann. Probab. 20 (1992) 1229-1247]. Here we prove a multivariate version of the elementary renewal theorem and moreover we obtain a rate of convergence result in this elementary renewal theorem. We close the paper with an application and some concluding remarks. For convenience we prove and formulate the results in the two-dimensional case only.     

Monotone method for singular BVP in the presence of upper and lower solutions

In this paper we examine existence of monotone approximations of solutions of singular boundary value problem -(p(x)y^′(x))^′=q(x)f(x,y,py^′) for 0<x?b and lim_x→0⁺p(x)y^′(x)=0,α₁y(b)+β₁p(b)y^′(b)=γ₁. Under quite general conditions on f(x,y,py^′) we show that solution of the singular two point boundary value problem is unique. Here is allowed to have integrable singularity at x=0 and we do not assume .     

Existence-uniqueness results for a class of singular boundary value problems-II

In this paper we establish existence-uniqueness of solution of a class of singular boundary value problem −(p(x)y^′′(x))=q(x)f(x,y) for 0<x?b and y(0)=a, α₁y(b)+β₁y^′(b)=γ₁, where p(x) satisfies (i) p(x)>0 in (0,b), (ii) p(x)∈C¹(0,r), and for some r>b, (iii) is analytic in and q(x) satisfies (i) q(x)>0 in (0,b), (ii) q(x)∈L¹(0,b) and for some r>b, (iii) is analytic in with quite general conditions on f(x,y). Region for multiple solutions have also been determined.     

Centers for a 6-parameter family of polynomial vector fields of arbitrary degree

For all non-negative integers n₁,n₂,n₃,j₁,j₂ and j₃ with nk+jk>1 for k=1,2,3, (nk,jk)≠(nl,jl) if k≠l, j₃=n₃−1 and jk≠nk−1 for k=1,2, we study the center variety of the 6-parameter family of real planar polynomial vector given, in complex notation, by , where z=x+iy and A,B,C∈C\{0}.     

An effective iterative method for computing real and complex roots of systems of nonlinear equations

A simple and flexible iterative method is proposed to determine the real or complex roots of any system of nonlinear equations F(x)=0. The idea is based on passing defined functions G_j(x_j),j=1,…,n tangent to F_i(x_j),i,j=1,…,n at an arbitrary starting point. Choosing G_j(x_j) in the form of or or any other reversible function compatible to F_i(x_j), where k is obtained for the best correlation with the function F_i(x_j), gives an added freedom, which in contrast with all existing methods, accelerates the convergence.The method that was first proposed for computing the roots of any single function is now adopted for a system of nonlinear equations. This method is compared to some classical and famous methods such as Newton’s method and Newton-Simpson’s method. The results show the effectiveness and robustness of this new method.     

Likelihood ratio orderings of spacings of heterogeneous exponential random variables

Let X₁,X₂,…,X_n be independent exponential random variables such that X_i has failure rate λ for i=1,…,p and X_j has failure rate λ^* for j=p+1,…,n, where p≥1 and q=n-p≥1. Denote by D_i:n(p,q)=X_i:n-X_i-1:n the ith spacing of the order statistics , where X_0:n≡0. It is shown that D_i:n(p,q)?_lrD_i+1:n(p,q) for i=1,…,n-1, and that if λ?λ^* then , and for i=1,…,n, where ?_lr denotes the likelihood ratio order. The main results are used to establish the dispersive orderings between spacings.     

On the sectional invariants of polarized manifolds

Let (X,L) be a polarized manifold of dimension n. In this paper, for any integer i with 0≤i≤n we introduce the notion of the ith sectional invariant of (X,L). We define the ith sectional Euler number e_i(X,L), the ith sectional Betti number b_i(X,L), and the ith sectional Hodge number of type (j,i−j) of (X,L) and we will study some properties of these.     

Positive periodic solutions of functional differential equations

We consider the existence, multiplicity and nonexistence of positive ω-periodic solutions for the periodic equation x′(t)=a(t)g(x)x(t)−λb(t)f(x(t−τ(t))), where are ω-periodic, , , f,g∈C([0,∞),[0,∞)), and f(u)>0 for u>0, g(x) is bounded, τ(t) is a continuous ω-periodic function. Define , , i₀=number of zeros in the set and i_∞=number of infinities in the set . We show that the equation has i₀ or i_∞ positive ω-periodic solution(s) for sufficiently large or small λ>0, respectively.     

Equitable colorings of Kronecker products of graphs

For a positive integer k, a graph G is equitably k-colorable if there is a mapping f:V(G)→{1,2,…,k} such that f(x)≠f(y) whenever xy∈E(G) and ||f⁻¹(i)|−|f⁻¹(j)||≤1 for 1≤i<j≤k. The equitable chromatic number of a graph G, denoted by χ₌(G), is the minimum k such that G is equitably k-colorable. The equitable chromatic threshold of a graph G, denoted by , is the minimum t such that G is equitably k-colorable for k≥t. The current paper studies equitable chromatic numbers of Kronecker products of graphs. In particular, we give exact values or upper bounds on χ₌(G×H) and when G and H are complete graphs, bipartite graphs, paths or cycles.