We obtain an asymptotic expansion of planar orthogonal polynomials with respect to exponentially varying weights, relevant for random matrix theory. As a consequence we show that the density of states in the random normal matrix model has universal error function transition across smooth interfaces for the limiting eigenvalue density. The key ingredient in the proof of the asymptotic expansion is the construction of the orthogonal foliation flow: a smooth flow of closed curves foliating a neighborhood of the interface, where the weighted L^2-mass of the orthogonal polynomial concentrates. The defining property of the flow is that the orthogonal polynomial of a given degree with respect to the disintegrated weighted area measure on the curves is approximately stationary in the flow parameter. To compute the coefficient functions in the expansion, we develop an algorithm which collapses the orthogonality relations to conditions along the interface, which become inhomogeneous Toeplitz kernel equations.

No abstract uploaded!

We discuss properties of the two-dimensional Landau Hamiltonian perturbed by a family of identical <i></i> potentials arranged equidistantly along a closed loop. It is demonstrated that for the loop size exceeding the effective size of the point obstacles and the cyclotronic radius such a system exhibits persistent currents at the bottom of the spectrum. We also show that the effect is sensitive to a small disorder.

In this work, an adaptive strategy for the phase space method for traveltime tomography (Chung et al 2007 Inverse Problems 23 30929) is developed. The method first uses those geodesics/rays that produce smaller mismatch with the measurements and continues on in the spirit of layer stripping without defining the layers explicitly. The adaptive approach improves stability, efficiency and accuracy. We then extend our method to reflection traveltime tomography by incorporating broken geodesics/rays for which a jump condition has to be imposed at the broken point for the geodesic flow. In particular, we show that our method can distinguish non-broken and broken geodesics in the measurement and utilize them accordingly in reflection traveltime tomography. We demonstrate that our method can recover the convex hull (with respect to the underlying metric) of unknown obstacles as well as the metric outside the

We propose a new efficient hardware implementation of Rainbow signature scheme. We enhance the implementation in three directions. First, we develop a new parallel hardware design for the Gauss-Jordan elimination, and solve a 12 ×12 system of linear equations with only 12 clock cycles. Second, a novel multiplier is designed to speed up multiplication of three elements over a finite field. Third, we design a novel partial multiplicative inverter to speed up the multiplicative inversion of finite field elements. Through further other minor optimizations of the parallelization process and by integrating the major optimizations above, we build a new hardware implementation, which takes only 198 clock cycles to generate a Rainbow signature, a new record in generating digital signatures and four times faster than the 804-clock-cycle Balasubramanian-Bogdanov-Carter-Ding-Rupp design with similar parameters.