Oscillatory criteria for nonlinearnth-order differential equations with quasiderivatives

Sufficient conditions are given for the existence of oscillatory proper solutions of a differential equation with quasiderivativesL _n y=f(t,L ₀ y, ..., L _n–1 y) under the validity of the sign conditionf(t,x ₁ ,...,x _n )x ₁0,f(t,0,x ₂ ,...,x _n )=0 on ₊ x ⁿ .     

Separately harmonic and subharmonic functions

Let u(x, y) be defined in B ₁×B ₂ where B ₁ ^m and B ₂ ⁿ , and assume that u(x, ·) harmonic for every fixed x and u(·, y) is subharmonic for every fixed y. We show that if u(·, y) is, in addition, C ² for each y then u is subharmonic in B ₁×B ₂ in both variables jointly.     

A new heuristic algorithm solving the linear ordering problem

The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized.     

A Construction of Partial Difference Sets in {\mathbb{Z}}_{p^{2 \times } } {\mathbb{Z}}_{p^{2 \times \cdot \cdot \cdot \times } } {\mathbb{Z}}_{p^2 }

In this paper, we give a construction of partial difference sets in _p ² x _p ² x ... x _p ²using some finite local rings.Dedicated to Hanfried Lenz on the occasion of his 80th birthdayThe work of this paper was done when the authors visited the University of Hong Kong.     

A finiteness theorem for maximal independent sets

Denote bymi(G) the number of maximal independent sets ofG. This paper studies the setS(k) of all graphsG withmi(G) = k and without isolated vertices (exceptG K ₁) or duplicated vertices. We determineS(1), S(2), andS(3) and prove that |V(G)| 2 ^k–1 +k – 2 for anyG inS(k) andk 2; consequently,S(k) is finite for anyk. Supported in part by the National Science Council under grant NSC 83-0208-M009-050