Star decompositions of cubes

Let Sk denote the complete bipartite graph K-1k and let e,, denote the ii-cube. We prove that the obvious necessary conditions for the existence of an S-k-decomposition of Q(n) are sufficient.

Three-point boundary value problems for second-order, ordinary, differential equations

We establish existence results for solutions to three-point boundary value problems for nonlinear, second-order, ordinary differential equations with nonlinear boundary conditions. (C) 2001 Elsevier Science Ltd. All rights reserved.

Topological methods for some boundary value problems

We establish existence of solutions for a finite difference approximation to y = f(x, y, y ') on [0, 1], subject to nonlinear two-point Sturm-Liouville boundary conditions of the form g(i)(y(i),y ' (i)) = 0, i = 0, 1, assuming S satisfies one-sided growth bounds with respect to y '. (C) 2001 Elsevier Science Ltd. All rights reserved.

On the Hopf bifurcation in control systems with a bounded nonlinearity asymptotically homogeneous at infinity

The paper studies existence, uniqueness, and stability of large-amplitude periodic cycles arising in Hopf bifurcation at infinity of autonomous control systems with bounded nonlinear feedback. We consider systems with functional nonlinearities of Landesman-Lazer type and a class of systems with hysteresis nonlinearities. The method is based on the technique of parameter functionalization and methods of monotone concave and convex operators. (C) 2001 Academic Press.

Star factorizations of graph products

A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.

Mathematical methods for spatially cohesive reserve design

The problem of designing spatially cohesive nature reserve systems that meet biodiversity objectives is formulated as a nonlinear integer programming problem. The multiobjective function minimises a combination of boundary length, area and failed representation of the biological attributes we are trying to conserve. The task is to reserve a subset of sites that best meet this objective. We use data on the distribution of habitats in the Northern Territory, Australia, to show how simulated annealing and a greedy heuristic algorithm can be used to generate good solutions to such large reserve design problems, and to compare the effectiveness of these methods.

Theory and applications of fuzzy Volterra integral equations

Formulations of fuzzy integral equations in terms of the Aumann integral do not reflect the behavior of corresponding crisp models. Consequently, they are ill-adapted to describe physical phenomena, even when vagueness and uncertainty are present. A similar situation for fuzzy ODEs has been obviated by interpretation in terms of families of differential inclusions. The paper extends this formalism to fuzzy integral equations and shows that the resulting solution sets and attainability sets are fuzzy and far better descriptions of uncertain models involving integral equations. The investigation is restricted to Volterra type equations with mildly restrictive conditions, but the methods are capable of extensive generalization to other types and more general assumptions. The results are illustrated by integral equations relating to control models with fuzzy uncertainties.

On positive solutions of nonlinear elliptic equations involving concave and critical nonlinearities

We study the existence of nonnegative solutions of elliptic equations involving concave and critical Sobolev nonlinearities. Applying various variational principles we obtain the existence of at least two nonnegative solutions.

Factorizations of and by powers of complete graphs

Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary and sufficient conditions for the existence of a K-k(r)-factorization of K-pn(s), where p is prime and k > 1, n, r and s are positive integers. (C) 2002 Elsevier Science B.V. All rights reserved.

Two-dimensional balanced sampling plans excluding contiguous units

A balanced sampling plan excluding contiguous units (or BSEC for short) was first introduced by Hedayat, Rao and Stufken in 1988. These designs can be used for survey sampling when the units are arranged in one-dimensional ordering and the contiguous units in this ordering provide similar information. In this paper, we generalize the concept of a BSEC to the two-dimensional situation and give constructions of two-dimensional BSECs with block size 3. The existence problem is completely solved in the case where lambda = 1.

Boundary value problems for systems of difference equations associated with systems of second-order ordinary differential equations

We study difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order ordinary differential equations. We formulate conditions which guarantee a priori bounds on first differences of solutions to the discretized problem. We establish existence results for solutions to the discretized boundary value problems subject to nonlinear boundary conditions. We apply our results to show that solutions to the discrete problem converge to solutions of the continuous problem in an aggregate sense. (C) 2002 Elsevier Science Ltd. All rights reserved.

Difference equations associated with fully nonlinear boundary value problems for second order ordinary differential equations

We study the continuous problem y"=f(x,y,y'), xc[0,1], 0=G((y(0),y(1)),(y'(0), y'(1))), and its discrete approximation (y(k+1)-2y(k)+y(k-1))/h(2) =f(t(k), y(k), v(k)), k = 1,..., n-1, 0 = G((y(0), y(n)), (v(1), v(n))), where f and G = (g(0), g(1)) are continuous and fully nonlinear, h = 1/n, v(k) = (y(k) - y(k-1))/h, for k =1,..., n, and t(k) = kh, for k = 0,...,n. We assume there exist strict lower and strict upper solutions and impose additional conditions on f and G which are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. We show that the discrete approximation also has solutions which approximate solutions of the continuous problem and converge to the solution of the continuous problem when it is unique, as the grid size goes to 0. Homotopy methods can be used to compute the solution of the discrete approximation. Our results were motivated by those of Gaines.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.