Drop spreading with random viscosity

We examine theoretically the spreading of a viscous liquid drop over a thin film of uniform thickness, assuming the liquid's viscosity is regulated by the concentration of a solute that is carried passively by the spreading flow. The solute is assumed to be initially heterogeneous, having a spatial distribution with prescribed statistical features. To examine how this variability influences the drop's motion, we investigate spreading in a planar geometry using lubrication theory, combining numerical simulations with asymptotic analysis. We assume diffusion is sufficient to suppress solute concentration gradients across but not along the film. The solute field beneath the bulk of the drop is stretched by the spreading flow, such that the initial solute concentration immediately behind the drop's effective contact lines has a long-lived influence on the spreading rate. Over long periods, solute swept up from the precursor film accumulates in a short region behind the contact line, allowing patches of elevated viscosity within the precursor film to hinder spreading. A low-order model provides explicit predictions of the variances in spreading rate and drop location, which are validated against simulations

Heterotic-string amplitudes at one loop: modular graph forms and relations to open strings

We investigate one-loop four-point scattering of non-abelian gauge bosons in heterotic string theory and identify new connections with the corresponding open-string amplitude. In the low-energy expansion of the heterotic-string amplitude, the integrals over torus punctures are systematically evaluated in terms of modular graph forms, certain non-holomorphic modular forms. For a specific torus integral, the modular graph forms in the low-energy expansion are related to the elliptic multiple zeta values from the analogous open-string integrations over cylinder boundaries. The detailed correspondence between these modular graph forms and elliptic multiple zeta values supports a recent proposal for an elliptic generalization of the single-valued map at genus zero.Comment: 57+22 pages, v2: references updated, version published in JHE

Sets with few distinct distances do not have heavy lines

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances, equivalent to distances in the Minkowski plane, where the distance between a pair of points is the area of the axis-parallel rectangle that they span

The existence and asymptotic properties of a backfitting projection algorithm under weak conditions.

We derive the asymptotic distribution of a new backfitting procedure for estimating the closest additive approximation to a nonparametric regression function. The procedure employs a recent projection interpretation of popular kernel estimators provided by Mammen, Marron, Turlach and Wand and the asymptotic theory of our estimators is derived using the theory of additive projections reviewed in Bickel, Klaassen, Ritov and Wellner. Our procedure achieves the same bias and variance as the oracle estimator based on knowing the other components, and in this sense improves on the method analyzed in Opsomer and Ruppert. We provide ‘‘high level’’ conditions independent of the sampling scheme. We then verify that these conditions are satisfied in a regression and a time series autoregression under weak conditions.