Study of the charge-exchange reactions\pi ^ - p \to (\pi ^0 ,\eta ,\eta \prime )n at 63 GeV

Muon electron pairs were detected in an Al multiplate spark chamber, exposed to a neutrino beam from the CERN PS. The leptons were not accompanied by other particles, except occasionally by protons. The background came mainly from muon associated π⁰ production, with one decay gamma lost. It was determined empirically, together with the small contribution from υ _e reactions. For electron energies above 2 GeV the background is 5.7±1.5 events, whereas 18 (μe)-candidates have been observed. Hence the effect is established, with a rate of about 10^?4 as compared to the muonic reactions above 3 GeV. Charm creation as the origin of this (μe)-production process is excluded; heavy neutral lepton production does not fit the kinematics observed. Instead the events are compatible with the two-body decay of an object with variable invariant mass of order 1 GeV, possibly resulting from axion interactions.     

Fine Dry Grinding of Zeolite in a Laboratory Ball Mill

This paper presents the importance and usage of natural zeolites, which was recently recognized in the industry. Therefore, the grinding properties of natural zeolite were studied with the emphasis on a kinetic study in a ball mill. The experimental mill employed was laboratory sized, 200 mm diameter, 191 mm length, providing a total mill volume of 6000 cm³, with a total mass of 5.62 kg of steel balls of 25 mm diameter with a charge of 20% of the mill volume and with a rotation speed of 76 rpm. The breakage parameters were determined by using single sized feed fractions of ?850+600 μm, ?600+425 μm, and ?425+300 μm for the zeolite samples. The S_i (specific rate of breakage) and B_{i, j} (primary breakage distribution) values were obtained for those feed size fractions in order to predict the product size distributions by simulation for comparison to the experimental data. From the experimental results, S_i values increased as the feed sizes became coarser, i.e., the highest S_i value was 0.85 min^?1 for ?850+600 μm, while the lowest S_i value was 0.65 min^?1 for ?425+300 μm feed ground in the mill. The B_{i, j} values obtained for the zeolite sample were γ=0.84, ?=0.61, and β=4.25. The breakage parameters obtained showed that the zeolite is broken faster than quartz and slower than calcite and barite in terms of the a_T values reported previously at the same experimental conditions. The simulations of the product size distributions of zeolite were in good agreement with the experimental data using a standard ball mill simulation program. The slowing‐down effect was also seen in the mill after 4 min. of grinding.     

Reply to Nathan: How to reconstruct the causal argument

Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.     

Sub-bundles of the complexified tangent bundle

We study embeddings of complex vector bundles, especially line bundles, in the complexification of the tangent bundle of a manifold. The aim is to understand implications of properties of interest in partial differential equations.

     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations

Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties of iterative solvers. Received August 5, 2000 / Published online June 20, 2001