High energy physics in the atmosphere: phenomenology of cosmic ray air showers

The properties of cosmic rays with energies above 10⁶ GeV have to be deduced from the spacetime structure and particle content of the air showers which they initiate. In this review we summarize the phenomenology of these giant air showers. We describe the hadronic interaction models used to extrapolate results from collider data to ultra high energies, and discuss the prospects for insights into forward physics at the LHC. We also describe the main electromagnetic processes that govern the longitudinal shower evolution, as well as the lateral spread of particles. Armed with these two principal shower ingredients and motivation from the underlying physics, we provide an overview of some of the different methods proposed to distinguish primary species. The properties of neutrino interactions and the potential of forthcoming experiments to isolate deeply penetrating showers from baryonic cascades are also discussed. We finally venture into a terra incognita endowed with TeV-scale gravity and explore anomalous neutrino-induced showers.     

Nonadiabatic geometric phase in quaternionic Hilbert space

We develop the theory of the nonadiabatic geometric phase, in both the Abelian and non-Abelian cases, in quaternionic Hilbert space.     

Crossing of shears bands in196Pb

High-spin states in¹⁹⁶Pb have been populated using the reaction¹⁷⁰Er(³⁰Si,4n). The previously observed shears bands in this nucleus have been extended and some of their transitions have been reordered. They now form regular bands with band crossings. One of the bands splits into two pathways at high spin.     

Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.     

Using Inquiry to Improve Pedagogy through K‐12/University Partnerships

This article focuses on the impact a collaborative project between university graduate fellows and K‐12 classroom teachers had on improved pedagogy in the classroom and in the future at the university. Nine teams participated in a yearlong professional development project to improve pedagogy and communication skills of the participants. This study shows that the participants, the fellows and the K‐12 teacher partners, made changes in planning, implementation, and even motivation for using inquiry‐based methods in their classroom. External observations of the teams further support the individuals' claims of improved pedagogy using inquiry and impact on student conceptual understanding. The Horizon Classroom Observation instrument was used for these observations. The teams showed an overall increase in scores, as well as overall effective and exemplarily implementation of their planning. The program design, the implementation, and the results of this three‐year study will be elaborated in this article.