Increasing interest in three-dimensional nanostructures adds impetus to electron microscopy techniques capable of imaging at or below the nanoscale in three dimensions. We present a reconstruction algorithm that takes as input a focal series of four-dimensional scanning transmission electron microscopy (4D-STEM) data. We apply the approach to a lead iridate, Pb$_2$Ir$_2$O$_7$, and yttrium-stabilized zirconia, Y$_{0.095}$Zr$_{0.905}$O$_2$, heterostructure from data acquired with the specimen in a single plan-view orientation, with the epitaxial layers stacked along the beam direction. We demonstrate that Pb–Ir atomic columns are visible in the uppermost layers of the reconstructed volume. We compare this approach to the alternative techniques of depth sectioning using differential phase contrast scanning transmission electron microscopy (DPC-STEM) and multislice ptychographic reconstruction.

4D-STEM, in which the 2D diffraction plane is captured for each 2D scan position in the scanning transmission electron microscope (STEM) using a pixelated detector, is complementing, and increasingly replacing existing imaging approaches. However, at present the speed of those detectors, although having drastically improved in the recent years, is still 100 to 1,000 times slower than the current PMT technology operators are used to. Regrettably, this means environmental scanning-distortion often limits the overall performance of the recorded 4D data. Here, we present an extension of existing STEM distortion correction techniques for the treatment of 4D data series. Although applicable to 4D data in general, we use electron ptychography and electric-field mapping as model cases and demonstrate an improvement in spatial fidelity, signal-to-noise ratio (SNR), phase precision, and spatial resolution.

In an r-uniform hypergraph on n vertices, a tight Hamilton cycle consists of n edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of r vertices. We provide a first deterministic polynomial-time algorithm, which finds a.a.s. tight Hamilton cycles in random r-uniform hypergraphs with edge probability at least C log3n/n.

Our result partially answers a question of Dudek and Frieze, who proved that tight Hamilton cycles exist already for p = ω(1/n) for r = 3 and p = (e + o(1))/n for $r \ge 4$ using a second moment argument. Moreover our algorithm is superior to previous results of Allen, Böttcher, Kohayakawa and Person, and Nenadov and Škorić, in various ways: the algorithm of Allen et al. is a randomized polynomial-time algorithm working for edge probabilities $p \ge {n^{ - 1 + \varepsilon}}$, while the algorithm of Nenadov and Škorić is a randomized quasipolynomial-time algorithm working for edge probabilities $p \ge C\mathop {\log }\nolimits^8 n/n$.