In the paper by D. Burago, S. Ivanov and A. Novikov, “A survival guide for feeble fish”, it has been shown that a fish with limited velocity can reach any point in the (possibly unbounded) ocean provided that the fluid velocity field is incompressible, bounded and has vanishing mean drift. This result extends some known global controllability theorems though being substantially nonconstructive. We give a fish a different recipe...

We give a constructive proof of a global controllability result for an autonomous system of ODEs guided by bounded locally Lipschitz and divergence free (i.e. incompressible) vector field, when the phase space is the whole Euclidean space and the vector field satisfies so-called vanishing mean drift condition. For the case when the ODE is defined over some smooth compact connected Riemannian manifold, we significantly strengthen...

We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth's recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth's recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.

We show the existence of a measurable selector in Carpenter’s Theorem due to Kadison. This solves a problem posed by Jasper and the first author in an earlier work. As an application we obtain a characterization of all possible spectral functions of shift-invariant subspaces of L 2 (R d ) and Carpenter’s Theorem for type I ∞ von Neumann algebras.

In this paper, we investigate an acceleration of the discrete Green's function (DGF) formulation of the FDTD method (DGF-FDTD) with the use of recurrence schemes. The DGF-FDTD method allows one to compute FDTD solutions as a convolution of the excitation with the DGF kernel. Hence, it does not require to execute a leapfrog time-stepping scheme in a whole computational domain for this purpose. Until recently, the DGF generation...