The role of myeloperoxidase and superoxide anion in the luminol- and lucigenin-dependent chemiluminescence of human neutrophils

The amount of chemiluminescence (CL) or light that is emitted from human polymorphonuclear leukocytes (PMN) during phagocytosis or activation by soluble stimuli is dependent on the emission of photons from the oxidation of particulate or bystander molecules. Because the compounds luminol and lucigenin yield photons with high quantum efficiency these agents have been introduced to sensitively assess PMN-CL. Since there is limited information about the pathways involved in the chemiluminescence of these compounds, we investigated the role of both myeloperoxidase (MPO) and superoxide anion (· O₂^?) in luminol-and lucigenin-PMN-CL. We compared the CL between normal and MPO- deficient PMN using zymosan for phagocytosis and N-formylmethionyleucylphenylalanine (FMLP) as a soluble stimulus. Our data demonstrated that luminol-CL was dependent on the presence of MPO and independent of · O₂^? generation during phagocytosis but independent of MPO during FMLP activation. In contrast lucigenin-CL was independent of MPO during both phagocytosis and FMLP activation and appeared to reflect · O₂^? production. Consequently, dependent on the type of activation, it appears that luminol- and lucigenin-CL are generated via different oxidative pathways and may serve as potentially useful tools to differentiate the redox activity of phagocytic cells.     

The combinatorial game Nofil played on Steiner triple systems

We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions.