67 citations
- California Institute of TechnologyUS1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- Courant Institute of Mathematical SciencesUS1 paper
- Florida State UniversityUS1 paper
- Max Planck Institute of Quantum OpticsDE1 paper
- Max Planck SocietyDE1 paper
- New York UniversityUS1 paper
- Oak Ridge National LaboratoryUS1 paper
- Technical University of MunichDE1 paper
- University of AugsburgDE1 paper
- University of GeorgiaUS1 paper
7 papers
Dissociation of Feshbach Molecules into Different Partial Waves
Stephan Dürr, Thomas Volz, Niels Syassen +5
Ultracold molecules can be associated from ultracold atoms by ramping the magnetic field through a Feshbach resonance. A reverse ramp dissociates the molecules. Under suitable cond…
On the Complexity of Several Haplotyping Problems
Rudi Cilibrasi, Leo van Iersel, Steven Kelk +1
In this paper we present a collection of results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete…
Terahertz Conductivity at the Verwey Transition in Magnetite
A. Pimenov, S. Tachos, T. Rudolf +5
The complex conductivity at the (Verwey) metal-insulator transition in Fe_3O_4 has been investigated at THz and infrared frequencies. In the insulating state, both the dynamic cond…
Cl electrosorption on Ag(100): Lateral interactions and electrosorption valency from comparison of Monte Carlo simulations with chronocoulometry experiments
I. Abou Hamad, S. J. Mitchell, Th. Wandlowski +2
We present Monte Carlo Simulations using an equilibrium lattice-gas model for the electrosorption of Cl on Ag(100) single-crystal surfaces. Fitting the simulated isotherms to chron…
Subexponential asymptotics of hybrid fluid and ruin models
Bert Zwart, Sem Borst, Krzystof Debicki
We investigate the tail asymptotics of the supremum of X(t)+Y(t)-ct, where X={X(t),t\geq 0} and Y={Y(t),t\geq 0} are two independent stochastic processes. We assume that the proces…
Counting Connected Graphs Asymptotically
Remco van der Hofstad, Joel Spencer
We find the asymptotic number of connected graphs with vertices and edges when approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\e…