Existence and Uniqueness of Solutions for a Class of Reaction-diffusion Systems

61.Intr0ducti0nInthispaper,wediscussareactionnetinacombusti0nmodel:V={R,,R2},whereR,andR2aredistinctreacti0nprocesses:Rl:A1+A,-A,,R2:A2+A3-P,A,(j=1,2,3)denotesthereactant,andPdenotestheinertproduct.Thesereactionsareexothermicreactions-LetQ,,Q2standforheatenergiesandU=(U,,U,,U,,U,)forstatevariablesdescribingreactions,whereUoisreactiontemporature,andU,(j=1,2,3)isthemolarityofthej-threactant.AssumethatV,(i=1,2)isthereactantvariablefortheithreactionpr0cess:V,=(Q,,1,-l,l)",V2=(Q,,O,-l,-…     

On lower bounds for theL 2-Wasserstein metric in a Hilbert space

We provide two families of lower bounds for theL ²-Wasserstein metric in separable Hilbert spaces which depend on the basis chosen for the space. Then we focus on one of these families and we provide a necessary and sufficient condition for the supremum in it to be attained. In the finite dimensional case, we identify the basis which provides the most accurate lower bound in the family.Research partially supported by the Spanish DGICYT under grants PB91-0306-02-00, 01 and 02.     

Lower closure and existence theorems for optimal control problems with infinite horizon

Lower closure theorems are proved for optimal control problems governed by ordinary differential equations for which the interval of definition may be unbounded. One theorem assumes that Cesari's property (Q) holds. Two theorems are proved which do not require property (Q), but assume either a generalized Lipschitz condition or a bound on the controls in an appropriateL _p-space. An example shows that these hypotheses can hold without property (Q) holding.     

Common complements of two subspaces of a Hilbert space

In this paper we find a necessary and sufficient condition for two closed subspaces, and , of a Hilbert space to have a common complement, i.e. a subspace having trivial intersection with and and such that .Unlike the finite-dimensional case the condition is significantly more subtle than simple equalities of dimensions and codimensions, and non-trivial examples of subspaces without a common complement are possible.     

Randomized on-line scheduling on three processors

We consider a randomized on-line scheduling problem where each job has to be scheduled on any of m identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for m=3 processors must be strictly greater than .     

Selecting distances in arrangements of hyperplanes spanned by points

In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, , determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(nlog²n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n²log²n) runtime algorithm. We generalize these results to the d-dimensional (d4) space and consider also a problem of enumerating distances.     

The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds

This paper is the second of a two part series and describes new lower and upper bounds for a more general version of the Two-Dimensional Finite Bin Packing Problem (2BP) than the one considered in Part I (see Boschetti and Mingozzi 2002). With each item is associated an input parameter specifying if it has a fixed orientation or it can be rotated by . This problem contains as special cases the oriented and non-oriented 2BP. The new lower bound is based on the one described in Part I for the oriented 2BP. The computational results on the test problems derived from the literature show the effectiveness of the new proposed lower and upper bounds.     

Full analogy of Sharkovsky's theorem for lower semicontinuous maps

A full analogy of the celebrated Sharkovsky cycle coexistence theorem is established for lower semicontinuous (multivalued) maps on metrizable linear continua. This result is further extended to triangular maps.     

A unifying approach to integration for bounded positive charges

This paper deals with n-monotone functionals, which constitute a generalisation of n-monotone set functions. Using the notion of exactness of a functional, we introduce a new notion of lower and upper integral which subsumes as particular cases most of the approaches to integration in the literature. As a consequence, we can characterise which types of integrals can be used to calculate the natural extension (the lower envelope of all linear extensions) of a positive bounded charge.