Enhanced electron–ion recombination in ion storage rings

We review recent advances in the understanding of the enhanced electron–ion recombination observed in storage ring experiments. The measured recombination rates show a strong enhancement relative to what the standard radiative recombination rates predict. A transient motional electric field is induced in the merging region of an electron and an ion beam in the electron cooler. This induced field opens an additional pathway for free-bound transitions of electrons. The formed Rydberg states can be radiatively stabilized and contribute to the measured rate. We show that this “field induced recombination” (FIR) explains the gap previously observed between measurements and the standard radiative recombination rate.     

Two- and three-dimensional analysis of bose-einstein correlations inπ +/K+p interactions at 250 GeV/c

The NA22 data onπ ^? π ^? correlations are analyzed in terms of a number of two- and three-dimensional parametrizations (Gaussian space-time, Goldhaber, Bowler string-like, Bertsch hydrodynamical, Kopylov-Podgoretskii, etc.). Contrary to the results obtained for e⁺e^? andµp collisions, the Goldhaber parametrization, as well as string-like models, fail in describing the hadron-hadron data. Better fits are obtained in the framework of surface-emitting fireball-like models, both when including and excluding hydrodynamical expansion of nuclear matter. Our results indicate that pion radiation occurs at earlier stages of matter evolution than in nuclear collisions.     

Testing Extreme Value Conditions

A test statistic is developed that checks the validity of the extreme value conditions without specifiying the shape parameter of the limiting extreme value distribution.     

Transmission line analysis of nonlinear slot coupled microstrip antenna

The transmission line method is used for the analysis of microstrip antennas fed by several nonlinear slots with 'H' shapes or new geometries. This analysis allows the input impedance of nonlinear slot coupled microstrip antennas to be calculated for the four different structures.<>     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.