Comparison of Transfer-to-Continuum and Eikonal Models of Projectile Fragmentation Reactions

Spectroscopic properties of nuclei are accessible with projectile fragmentation reactions, but approximations made in the reaction theory can limit the accuracy of the determinations. We examine here two models that have rather different approximations for the nucleon wave function, the target interaction, and the treatment of the finite duration of the reaction. The nucleon-target interaction is treated differently in the eikonal and the transfer-to-continuum model, but the differences are more significant for light targets. We propose a new parameterization with that in mind. We also propose a new formula to calculate the amplitude that combines the better treatment of the wave function in the eikonal model with the better treatment of the target interaction in the transfer-to-continuum model.Comment: 21 pages, latex file including 3 tables. 5 figures. Submitted to Phys. Rev.

Viscoelastic Multicomponent Fluids in confined Flow-Focusing Devices

The effects of elasticity on the break-up of liquid threads in microfluidic cross-junctions is investigated using numerical simulations based on the "lattice Boltzmann models" (LBM). Working at small Capillary numbers, we investigate the effects of non-Newtonian phases in the transition from droplet formation at the cross-junction (DCJ) and droplet formation downstream of the cross-junction (DC) (Liu & Zhang, ${\it Phys. Fluids.}$ ${\bf 23}$, 082101 (2011)). Viscoelasticity is found to influence the break-up point of the threads, which moves closer to the cross-junction and stabilizes. This is attributed to an increase of the polymer feedback stress forming in the corner flows, where the side channels of the device meet the main channel.Comment: 4 pages, 2 figures, AIP Conference Proceedings, 201

Initial State Dependence of the Breakup of Weakly Bound Carbon Isotopes

The one-neutron nuclear breakup from the Carbon isotopes $^{19}$C and $^{17}$C, is calculated as an example of application of the theory of transfer to the continuum reactions in the formulation which includes spin coupling. The effect of the energy sharing between the parallel and transverse neutron momentum distributions is taken into account thus resulting in a theory which is more general than sudden eikonal approaches. Both effects are necessary to understand properly the breakup from not too weakly bound $l_i>1$ orbitals. Breakup which leaves the core into an excited state below particle threshold is also considered. The core-target interaction is treated in the smooth cut-off approximation. By comparing to presently available experimental data we show how to make some hypothesis on the quantum numbers and occupancy of the neutron initial state. Possible ambiguities in the interpretation of inclusive cross sections are discussed.Comment: 22 RevTeX pages,3 ps figures. Phys. Rev. C, accepte

Coulomb and nuclear breakup effects in the single neutron removal reaction 197Au(17C,16C gamma)X

We analyze the recently obtained new data on the partial cross sections and parallel momentum distributions for transitions to ground as well as excited states of the 16C core, in the one-neutron removal reaction 197Au(17C,16C gamma)X at the beam energy of 61 MeV/nucleon. The Coulomb and nuclear breakup components of the one-neutron removal cross sections have been calculated within a finite range distorted wave Born approximation theory and an eikonal model, respectively. The nuclear contributions dominate the partial cross sections for the core excited states. By adding the nuclear and Coulomb cross sections together, a reasonable agreement is obtained with the data for these states. The shapes of the experimental parallel momentum distributions of the core states are described well by the theory.Comment: Revtex format, two figures included, to appear in Phys. Rev. C. (Rapid communications

Extended sudden approximation model for high-energy nucleon removal reactions

A model based on the sudden approximation has been developed to describe high energy single nucleon removal reactions. Within this approach, which takes as its starting point the formalism of Hansen \cite{Anne2}, the nucleon-removal cross section and the full 3-dimensional momentum distributions of the core fragments including absorption, diffraction, Coulomb and nuclear-Coulomb interference amplitudes, have been calculated. The Coulomb breakup has been treated to all orders for the dipole interaction. The model has been compared to experimental data for a range of light, neutron-rich psd-shell nuclei. Good agreement was found for both the inclusive cross sections and momentum distributions. In the case of $^{17}$C, comparison is also made with the results of calculations using the transfer-to-the-continuum model. The calculated 3-dimensional momentum distributions exhibit longitudinal and transverse momentum components that are strongly coupled by the reaction for s-wave states, whilst no such effect is apparent for d-waves. Incomplete detection of transverse momenta arising fromlimited experimental acceptances thus leads to a narrowing of the longitudinal distributions for nuclei with significant s-wave valence neutron configurations, as confirmed by the data. Asymmetries in the longitudinal momentum distributions attributed to diffractive dissociation are also explored.Comment: 16 figures, submitted to Phys. Rev.

Proton vs. neutron halo breakup

In this paper we show how effective parameters such as effective binding energies can be defined for a proton in the combined nuclear-Coulomb potential, including also the target potential, in the case in which the proton is bound in a nucleus which is partner of a nuclear reaction. Using such effective parameters the proton behaves similarly to a neutron. In this way some unexpected results obtained from dynamical calculations for reactions initiated by very weakly bound proton halo nuclei can be interpreted. Namely the fact that stripping dominates the nuclear breakup cross section which in turn dominates over the Coulomb breakup even when the target is heavy at medium to high incident energies. Our interpretation helps also clarifying why the existence and characteristics of a proton halo extracted from different types of data have sometimes appeared contradictory.Comment: 7 Latex pages, 3 table, 3 ps figures, to appear in Phys. Rev.

Evanescent-wave coupled right angled buried waveguide: Applications in carbon nanotube mode-locking

In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by a sequence of edge/hyperedge insertions and deletions) and distributed systems such as MapReduce. In the case of dynamic graph streams, we use this primitive to prove the following results: -- Matching: First, there exists an $\tilde{O}(k^2)$ space algorithm that returns an exact maximum matching on the assumption the cardinality is at most $k$. The best previous algorithm used $\tilde{O}(kn)$ space where $n$ is the number of vertices in the graph and we prove our result is optimal up to logarithmic factors. Our algorithm has $\tilde{O}(1)$ update time. Second, there exists an $\tilde{O}(n^2/\alpha^3)$ space algorithm that returns an $\alpha$-approximation for matchings of arbitrary size. (Assadi et al. (2015) showed that this was optimal and independently and concurrently established the same upper bound.) We generalize both results for weighted matching. Third, there exists an $\tilde{O}(n^{4/5})$ space algorithm that returns a constant approximation in graphs with bounded arboricity. -- Vertex Cover and Hitting Set: There exists an $\tilde{O}(k^d)$ space algorithm that solves the minimum hitting set problem where $d$ is the cardinality of the input sets and $k$ is an upper bound on the size of the minimum hitting set. We prove this is optimal up to logarithmic factors. Our algorithm has $\tilde{O}(1)$ update time. The case $d=2$ corresponds to minimum vertex cover. Finally, we consider a larger family of parameterized problems (including $b$-matching, disjoint paths, vertex coloring among others) for which our subgraph sampling primitive yields fast, small-space dynamic graph stream algorithms. We then show lower bounds for natural problems outside this family