One cannot hear orbifold isotropy type

We show that the isotropy types of the singularities of Riemannian orbifolds are not determined by the Laplace spectrum. Indeed, we construct arbitrarily large families of mutually isospectral orbifolds with different isotropy types. Finally, we show that the corresponding singular strata of two isospectral orbifolds may not be homeomorphic. Received: 6 October 2005     

Corrigendum to the paper ``Adjoining an Order Unit to a Matrix Ordered Space'

An error has been detected (and also corrected) in Theorem 2.8 of the paper entitled “Adjoining an Order Unit to a Matrix Ordered Space” (Positivity, (2005)9: 207–223; DOI ). Accordingly, some of the results of the paper have been modified. Also, a notion of C*-matricially, Riesz normed spaces has been introduced.     

Every group has a terminating transfinite automorphism tower

Iteratively taking the automorphism group of any group leads, transfinitely, to a fixed point.

     

A techno-economic assessment of the pretreatment and fractionation steps of a biomass-to-ethanol process

Applied Biochemistry and Biotechnology - It is generally recognized that the front-end (pretreatment, fractionation, enzymatic hydrolysis) steps of a lignocellulose-to-ethanol process are both...     

Existence of magnetic charge

A status report is presented on the existence of quarks carrying the Dirac unit of magnetic chargeg = (137/2)e. The Paschen-Back effect in dyonium is discussed. From the dyonium model, Akers predicted the existence of a new meson at 1814 MeV withI ^G(J^PC) = 0⁺(0^–+). Experimental evidence now confirms the existence of the meson resonance.     

On characterizing collections arising from N-gons in the plane

Consider a labeled convex n-gon in the plane and a point x in general position in the interior. We associate with this a collection (x) of 3-element sets, namely those 3-element subsets of the vertices which contain x in their interior. We investigate the problem of characterizing those collections of subsets which can be represented in this matter. We give a complete characterization of this and a related problem.School of Mathematics, University of Minnesota, Minneapolis, MN 55455. This work was supported in part by NSF grant DMS-8700995.Department of Mathematics, University College London, Gower Street, London, WC1E 6BT, England. Work done while Hill Visiting Professor at the University of Minnesota.     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.