The PI index of product graphs

The Padmakar–Ivan index of a graph G is the sum over all edges uv of G of number of edges which are not equidistant from u and v. In this work, an exact expression for the PI index of the Cartesian product of bipartite graphs is computed. Using this formula, the PI indices of C₄ nanotubes and nanotori are computed.     

Positive solutions for a scalar differential equation with several delays

For a scalar delay differential equation , we obtain new explicit conditions for the existence of a positive solution.     

Approximate solution of the Fredholm integral equation of the first kind in a reproducing kernel Hilbert space

An approach for solving Fredholm integral equations of the first kind is proposed for in a reproducing kernel Hilbert space (RKHS). The interest in this problem is strongly motivated by applications to actual prospecting. In many applications one is puzzled by an ill-posed problem in space C[a,b] or L²[a,b], namely, measurements of the experimental data can result in unbounded errors of solutions of the equation. In this work, the representation of solutions for Fredholm integral equations of the first kind is obtained if there are solutions and the stability of solutions is discussed in RKHS. At the same time, a conclusion is obtained that approximate solutions are also stable with respect to _∞ or _L² in RKHS. A numerical experiment shows that the method given in the work is valid.     

Existence of an elliptic system involving Pucci operator

We study the existence of solutions for the nonlinear elliptic system

where Ω is a bounded domain, f₁ is superlinear and f₂ is sublinear at zero and infinity, h₁ and h₂ are perturbation terms. We will show that the system has at least two semi-trivial solutions (u,0), (0,v) and a nontrivial solution (u^*,v^*).     

Space-efficient geometric divide-and-conquer algorithms

We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric problems that have solutions using some form of divide-and-conquer. Specifically, we present a deterministic algorithm running in time using extra memory given inputs of size n for the closest pair problem and a randomized solution running in expected time and using extra space for the bichromatic closest pair problem. For the orthogonal line segment intersection problem, we solve the problem in time using extra space where n is the number of horizontal and vertical line segments and k is the number of intersections.     

Precise asymptotics for the first moment of the error variance estimator in linear models

Let σ² be the unknown error variance of a linear model and let be the estimator of σ² based on the residual sum of squares. In this work, we show the precise asymptotics in the law of the logarithm for the first moment of the error variance estimator.     

The number of translates of a closed nowhere dense set required to cover a Polish group

For a Polish group let be the minimal number of translates of a fixed closed nowhere dense subset of required to cover . For many locally compact this cardinal is known to be consistently larger than which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups . For example the equality holds for the group of permutations of the integers, the additive group of a separable Banach space with an unconditional basis and the group of homeomorphisms of various compact spaces.     

Minimum weight pseudo-triangulations

We consider the problem of computing a minimum weight pseudo-triangulation of a set of n points in the plane. We first present an -time algorithm that produces a pseudo-triangulation of weight which is shown to be asymptotically worst-case optimal, i.e., there exists a point set for which every pseudo-triangulation has weight , where is the weight of a minimum weight spanning tree of . We also present a constant factor approximation algorithm running in cubic time. In the process we give an algorithm that produces a minimum weight pseudo-triangulation of a simple polygon.     

Nonlinear maps preserving Lie products on factor von Neumann algebras

In this paper, we prove that every bijective map preserving Lie products from a factor von Neumann algebra into another factor von Neumann algebra is of the form A→ψ(A)+ξ(A), where is an additive isomorphism or the negative of an additive anti-isomorphism and is a map with ξ(AB-BA)=0 for all .     

Uniform asymptotic expansions of the Pollaczek polynomials

Two uniform asymptotic expansions are obtained for the Pollaczek polynomials P_n(cosθ;a,b). One is for , , in terms of elementary functions and in descending powers of . The other is for , in terms of a special function closely related to the modified parabolic cylinder functions, in descending powers of n. This interval contains a turning point and all possible zeros of P_n(cosθ) in θ(0,π/2].     

The second kind Chebyshev–Newton–Cotes quadrature rule (open type) and its numerical improvement

The weighted Newton–Cotes quadrature rules of open type are denoted by

where w(x) is a positive function and is the step size. Various cases can be selected for the weight function of the above formula. In this paper, we consider as the main weight function and study the general formula:

The precision degree of the above formula is n + 1 for even n’s and is n for odd n’s but if one considers its upper and lower bounds as two additional variables, a nonlinear system will be derived whose solution improves the precision degree of above formula up to degree n + 2 numerically. In this way, some examples are given to show the numerical superiority of our idea.     

Augmenting the connectivity of geometric graphs

Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected plane geometric graphs. In particular, we show that for G to become 2-edge connected, additional edges are required in some cases and that additional edges are always sufficient. For the special case of plane geometric trees, these bounds decrease to and , respectively.     

The minimum-area spanning tree problem

Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set of n points in the plane, find a spanning tree of of minimum “area”, where the area of a spanning tree is the area of the union of the n−1 disks whose diameters are the edges in . We prove that the Euclidean minimum spanning tree of is a constant-factor approximation for mast. We then apply this result to obtain constant-factor approximations for the Minimum-Area Range Assignment (mara) problem, for the Minimum-Area Connected Disk Graph (macdg) problem, and for the Minimum-Area Tour (mat) problem. The first problem is a variant of the power assignment problem in radio networks, the second problem is a related natural problem, and the third problem is a variant of the traveling salesman problem.     

Linear maps preserving idempotency of products or triple jordan products of operators

Let be the algebra of all bounded linear operators on a complex Banach space . We give the concrete forms of linear surjective maps on which preserve the nonzero idempotency of either products of two operators or triple Jordan products of two operators.     

Global stability of a rational difference equation

In this paper, we study the global stability of the difference equation , where the parameters a,a_i(0,∞) for i=0,…,k, x_-k,…, x_-1[0,∞) and x₀(0,∞). We prove that the unique positive equilibrium is globally asymptotically stable if and only if it is locally asymptotically. Also we provide sufficient condition for it to be globally asymptotically stable and our results solve the open problem proposed by Kulenović and Ladas (Dynamics of Second Order Rational Difference Equations with Open Problems and Conjectures, Chapman & Hall/CRC, Boca Raton, 2002).     

Real hypersurfaces in complex projective space with recurrent structure Jacobi operator

We classify real hypersurfaces of complex projective space , m3, with -recurrent structure Jacobi operator and apply this result to prove the non-existence of such hypersurfaces with recurrent structure Jacobi operator.     

On oscillatory solutions of certain first order ordinary differential equations

By constructing a class of solutions to the integral inequality for t  t₀ large enough, where 0<A₁a(τ)A₂<+∞ and λ>1, that tend to zero as t→+∞ we address an open problem in the theory of nonlinear oscillations.     

A Chebyshev type inequality for fuzzy integrals

In this paper, we prove a Chebyshev type inequality for fuzzy integrals. More precisely, we show that:

where μ is the Lebesgue measure on and f,g:[0,1]→[0,∞) are two continuous and strictly monotone functions, both increasing or both decreasing. Also, some examples and applications are presented.     

Global existence and blow-up solutions and blow-up estimates for a non-local quasilinear degenerate parabolic system

This paper deals with p-Laplacian systems

with null Dirichlet boundary conditions in a smooth bounded domain ΩR^N, where p,q>1, , and a,b>0 are positive constants. We first get the non-existence result for a related elliptic systems of non-increasing positive solutions. Secondly by using this non-existence result, blow-up estimates for above p-Laplacian systems with the homogeneous Dirichlet boundary value conditions are obtained under Ω=B_R={xR^N:|x|<R}(R>0). Then under appropriate hypotheses, we establish local theory of the solutions and obtain that the solutions either exists globally or blow-up in finite time.     

On the stability and boundedness of solutions of a kind of third order delay differential equations

In this paper, we study Eq. (1.1) for asymptotic stability of the zero solution when and uniformly bounded and uniformly ultimate bounded of all solutions when