When two liquid drops touch, a microscopic connecting liquid bridge forms and rapidly grows as the two drops merge into one. Whereas coalescence has been thoroughly studied when drops coalesce in vacuum or air, many important situations involve coalescence in a dense surrounding fluid, such as oil coalescence in brine. Here we study the merging of gas bubbles and liquid drops in an external flu...

The dynamics of bubble coalescence is studied using a robust numerical model for a multiphase flow system with interfaces. The effects of liquid viscosity and surface tension on bubble coalescence, for which Reynolds number ranges from 10 to 100 and Bond number ranges from 5 to 50, are investigated. It is shown that the numerical model used in this study can accurately capture the complex topol...

The size dependence of the drop coalescence frequency is investigated by measurement of transient drop size distributions in purely coalescing systems (with negligible drop break-up). A twopronged approach is employed to estimate the bivariate coalescence frequency function, using such experimental data. First, coalescence frequency expressions derived from mechanistic models of the relative mo...

Ab initio calculations at HF/6-31G* level of theory for geometry optimization and MP2/6-31G*//HF/6-31G*for total energy calculation are reported for Z-cyclooctene (1). The most favorable conformation of 1 is theunsymmetric boat-chair (1-BC) geometry. Potential energy profiles for two different boat-chair/boat-chairinterconversion processes were calculated. The process via a chair transition sta...

Electron-only magnetic reconnection, in which ions do not couple, has recently been observed turbulent magnetosheath and magnetotail, association with flux rope coalescence. This study reproduces the electron-only reconnection during island coalescence via 2.5-D particle-in-cell simulations. We find that degree of ion coupling is sensitive to spatial scale merging current sheet but determined b...

In a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues a random walk through the graph. Let G = (V,E), be an undirected and connected graph, with n vertices and m edges. The coalescence time, C(n), is the expected time for all particles to ...