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.     

Bubble point pressure estimates from Gibbs ensemble simulations

Bubble pressure points of ethanol–1,1,1,2,3,3,3-heptafluoropropane (HFC-227ea refrigerant) mixtures from the third Industrial Fluid Properties Simulation Challenge are computed using publicly available molecular simulation software. Several published force fields are compared against the known answers provided in the contest guidelines and the best force fields are used to make predictions for the unknown results.     

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.     

Category with a natural cone

Generally, in homotopy theory a cylinder object (or, its dual, a path object) is used to define homotopy between morphisms, and a cone object is used to build exact sequences of homotopy groups. Here, an axiomatic theory based on a cone functor is given. Suspension objects are associated to based objects and cofibrations, obtaining homotopy groups referred to an object and relative to a cofibration, respectively. Exact sequences of these groups are built. Algebraic and particular examples are given. We point out that the main results of this paper were already stated in [3], and the purpose of this article is to give full details of the foregoing.     

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.     

Novel acrylic macromonomer with amphiphilic character derived from Triton X‐100: Radical copolymerization with methyl methacrylate and thermal properties

This article explores the synthesis of a novel methacrylic macromonomer with an amphiphilic character derived from poly(ethylene glycol) tert‐octylphenyl ether (MT) and its respective homopolymer. To know their reactivity in radical copolymerization reactions with methyl methacrylate (MMA), a model monomer (MTm) was synthesized to determine the reactivity ratios and compare them with the low molar fractions of copolymers of MT with MMA because they were difficult to isolate. They were r_MTm = 0.97 and r_MMA = 0.95. The compositional diagrams when representing the weight fraction of MT and MTm in the feed and the copolymer suggested that a clear correlation exists between the experimental points of the model monomer MTm and the macromonomer MT ones, suggesting that the length of the side poly(ethylene oxide) chain does not affect the reactivity of the methacrylic double bond in the prepared monomers for this type of polymerization reaction. The reactivity ratios of the copolymers have a tendency for the formation of random or Bernoullian copolymers. The glass‐transition temperatures (T_g's) of the prepared copolymers were determined by differential scanning calorimetry, deviated from the Fox equation, and discussed on the basis of treatments that consider the influence of the monomeric units along the copolymer chains, determining the T_g of the corresponding alternating dyads. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1641–1649, 2003     

Mass‐lumping or not mass‐lumping for eigenvalue problems

In this article we analyze the effect of mass‐lumping in the linear triangular finite element approximation of second‐order elliptic eigenvalue problems. We prove that the eigenvalue obtained by using mass‐lumping is always below the one obtained with exact integration. For singular eigenfunctions, as those arising in non convex polygons, we prove that the eigenvalue obtained with mass‐lumping is above the exact eigenvalue when the mesh size is small enough. So, we conclude that the use of mass‐lumping is convenient in the singular case. When the eigenfunction is smooth several numerical experiments suggest that the eigenvalue computed with mass‐lumping is below the exact one if the mesh is not too coarse. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 653–664, 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.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.