On a pseudo-Riemannian manifoldM we introduce a system of partial differential Killing type equations for spinor-valued differential forms, and study their basic properties. We discuss the relationship between solutions of Killing equations onM and parallel fields on the metric cone overM for spinor-valued forms.

Let M be a closed connected spin manifold of dimension 2 or 3 with a fixed orientation and a fixed spin structure. We prove that for a generic Riemannian metric onM the non-harmonic eigenspinors of the Dirac operator are nowhere zero. The proof is based on a transversality theorem and the unique continuation property of the Dirac operator.

Submit Manuscript | http://medcraveonline.com Abbreviations: AML: Acute Myeloid Leukemia; CBC: Complete Blood Count; CML: Chronic Myeloid Leukemia; HIV: Human Immunodeficiency Virus; IFN-g: Interferon Gamma; INM: Inner Nuclear Membrane; LBR: Lamin B Receptor; MDS: Myelodysplastic Syndrome; NE: Nuclear Envelope; ONM: Outer Nuclear Membrane; PHA: Pelger-Huët Anomaly; PHA: PseudoPelger-Huët Anomal...

We show that there is a large class of nonspecial effective divisors of relatively small degree on real algebraic curves having many real components i.e. on M -curves. We apply to 1. complete linear systems onM -curves containing divisors with entirely real support, and 2. morphisms of M -curves into P.

We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the `p norms of weighted flow time onm identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.

Since the identification of the first disease causing mutation in the gene coding for emerin, a transmembrane protein of the inner nuclear membrane, hundreds of mutations and variants have been found in genes encoding for nuclear envelope components. These proteins can be part of the inner nuclear membrane (INM), such as emerin or SUN proteins, outer nuclear membrane (ONM), such as Nesprins, or...

We answer a question posed in [Elkies 1996] by constructing a class of pawn endgames onm×n boards that show the Nimbers ∗k for many large k. We do this by modifying and generalizing T.R. Dawson’s “pawns game” [Berlekamp et al. 1982]. Our construction works for m ≥ 9 and n sufficiently large; on the basis of computational evidence we conjecture, but cannot yet prove, that the construction yields...

This paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedules for independent jobs onm identical machines. In our online model, all jobs are submitted over time. We show that the commonly used makespan criterion is not well suited to describe utilization for this online problem. Therefore, we directly address utilization and determine themaximum deviation from th...