Tracing Possible Structural Asymmetry of Silica Gel Used for Precoating Thin-Layer Chromatography Plates

JPC – Journal of Planar Chromatography – Modern TLC - We have previously described unexpected two-dimensionality in the thin-layer chromatographic separation of pairs of enantiomers of...     

Quotient probabilistic normed spaces and completeness results

We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.     

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.     

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.     

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.