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.     

Limit behavior of global attractors for the complex Ginzburg–Landau equation on infinite lattices

In this work, the authors first show the existence of global attractors for the following lattice complex Ginzburg–Landau equation:

and for the following lattice Schrödinger equation:

Then they prove that the solutions of the lattice complex Ginzburg–Landau equation converge to that of the lattice Schrödinger equation as ε→0+. Also they prove the upper semicontinuity of as ε→0+ in the sense that .     

Asymptotic analysis of a perturbation problem

An asymptotic expansion is constructed for the solution of the initial-value problem

when t is restricted to the interval [0,T/ε], where T is any given number. Our analysis is mathematically rigorous; that is, we show that the difference between the true solution u(t,x;ε) and the Nth partial sum of the asymptotic series is bounded by ε^N+1 multiplied by a constant depending on T but not on x and t.     

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.     

Kamenev-type oscillation criteria for even order neutral differential equations with deviating arguments

Sufficient conditions are established for the oscillation of even order neutral differential equations of the form

where n  2 is even integer.     

A new sharpened version of the Neuberg–Pedoe inequality

In this work, we present a new sharpened version of the classical Neuberg–Pedoe inequality. As an application, the following improved Neuberg–Pedoe inequality is derived:

     

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.     

Stability properties of non-negative solutions to a non-autonomous p-Laplacian equation

We study the stability of non-negative stationary solutions of

where Δ_p denotes the p-Laplacian operator defined by Δ_pz = div(z^p−2z); p > 2, Ω is a bounded domain in R^N(N  1) with smooth boundary where [0,1],h:∂Ω→R⁺ with h = 1 when  = 1, λ > 0, and g:Ω×[0,∞)→R is a continuous function. If g(x, u)/u^p−1 be strictly increasing (decreasing), we provide a simple proof to establish that every non-trivial non-negative solution is unstable (stable).     

Positive solutions of nonlinear fractional boundary value problems using Adomian decomposition method

We use Adomian decomposition method for solving the fractional nonlinear two-point boundary value problem

where D is Caputo fractional derivative, c is a constant, μ > 0, and F:[0,1]×[0,∞)→[0,∞) a continuous function. The fractional Bratu problem is solved as an illustrative example.     

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.     

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.     

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

Coding for a multiple access OR channel: A survey

The signature coding for M active users out of T total users over a multiple access OR channel is considered. The mathematical problem is equivalent to the M-cover-free problem of extremal set theory. We survey the upper and lower bounds on the minimal code word length n(T,M), and present some code constructions. According to the current state of the theory, for 1MT

so there is a huge gap between the upper and lower bounds. Moreover, there is no known construction approaching the upper bound.     

Numerical solution of Hammerstein integral equations by using combination of spline-collocation method and Lagrange interpolation

The numerical solutions to the nonlinear integral equations of the Hammerstein-type:

with using B-splines functions are investigated. An interpolation method based on B-splines functions combined with a new collocation method is presented. Finally, for showing efficiency of the method we give some numerical examples.     

A quadratic distance bound on sliding between crossing-free spanning trees

Let S be a set of n points in the plane and let be the set of all crossing-free spanning trees of S. We show that it is possible to transform any two trees in into each other by O(n²) local and constant-size edge slide operations. Previously no polynomial upper bound for this task was known, but in [O. Aichholzer, F. Aurenhammer, F. Hurtado, Sequences of spanning trees and a fixed tree theorem, Comput. Geom.: Theory Appl. 21 (1–2) (2002) 3–20] a bound of O(n²logn) operations was conjectured.     

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.     

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 .     

Oscillation criteria for a class of nonlinear system of differential equations

Using the integral average method, we establish some oscillation criteria of Kamenev type and Yan type for the nonlinear system of differential equation

where the functions b_i(t) (i = 1, 2) are nonnegative and summable on each finite segment of the interval Z0, ∞), λ_i > 0 (i = 1,2) with λ₁ λ₂ = 1.     

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

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^*).