Sequencing games without initial order

In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.     

Group-valued measures on coarse-grained quantum logics

In [3] it was shown that a (real) signed measure on a cyclic coarse-grained quantum logic can be extended, as a signed measure, over the entire power algebra. Later ([9]) this result was re-proved (and further improved on) and, moreover, the non-negative measures were shown to allow for extensions as non-negative measures. In both cases the proof technique used was the technique of linear algebra. In this paper we further generalize the results cited by extending group-valued measures on cyclic coarse-grained quantum logics (or non-negative group-valued measures for lattice-ordered groups). Obviously, the proof technique is entirely different from that of the preceding papers. In addition, we provide a new combinatorial argument for describing all atoms of cyclic coarse-grained quantum logics.     

Spectral Properties of Four-Dimensional Compact Flat Manifolds

We study the spectral properties of a large class of compact flat Riemannian manifolds of dimension 4, namely, those whose corresponding Bieberbach groups have the canonical lattice as translation lattice. By using the explicit expression of the heat trace of the Laplacian acting on p-forms, we determine all p-isospectral and L-isospectral pairs and we show that in this class of manifolds, isospectrality on functions and isospectrality on p-forms for all values of p are equivalent to each other. The list shows for any p, 1 ≤ p ≤ 3, many p-isospectral pairs that are not isospectral on functions and have different lengths of closed geodesics. We also determine all length isospectral pairs (i.e. with the same length multiplicities), showing that there are two weak length isospectral pairs that are not length isospectral, and many pairs, p-isospectral for all p and not length isospectral. Mathematics Subject Classifications (2000): 58J53, 58C22, 20H15.     

A polar macroporous sorbent for gas chromatography

Summary The gas chromatographic behaviour of crosslinked macroporous 2-hydroxyethyl methacrylate grafted with 2-methyloxazoline was investigated and the range of applicability of the copolymer was assessed. Retention index values were measured on this copolymer and compared with those obtained on the terpolymer 2-hydroxyethyl methacrylate-ethylene dimethacrylate-acrylonitrile. Rohrschneider constants and efficiency data for selected sorbates are given. The use of this type of polymer in the separation of various types of compounds is documented by various examples.     

On energy densities reached in heavy-ion collisions at the CERN SPS

We present a few estimates of energy densities reached in heavy-ion collisions at the CERN SPS. The estimates are based on data and models of proton-nucleus and nucleus-nucleus interactions. In all of these estimates the maximum energy density in central Pb+Pb interactions is larger than the critical energy density GeV/fm³ following from lattice gauge theory computations. In estimates which we consider as realistic the maximum energy density is about . In this way our analysis gives some support to claims that deconfined matter has been produced at the CERN SPS. Any definite statement requires a deeper understanding of formation times of partons and hadrons in nuclear collisions. We also compare our results with implicit energy estimates contained in earlier models of anomalous suppression in nuclear collisions. Received: 3 February 2003 / Revised version: 5 March 2003 / Published online: 5 May 2003     

A Multidimensional Branch-and-Prune Method for Interval Global Optimization

In this paper a new multidimensional extension of the recently developed one-dimensional enclosure method called kite is given for interval global optimization. A more sophisticated version of the pruning technique based on the kite method is introduced. By the new componentwise approach all the one-dimensional theoretical results and procedures can be used in the higher-dimensional case. The possibilities in the implementation of the new algorithm together with numerical results on 40 standard test problems are presented.