We consider Schrdinger operators in dimension 2 with a singular interaction supported by an infinite family of concentric spheres, analogous to a system studied by Hempel and coauthors for regular potentials. The essential spectrum covers a half line determined by the appropriate one-dimensional comparison operator; it is dense pure point in the gaps of the latter. If the interaction is nontrivial and radially periodic, there are infinitely many absolutely continuous bands; in contrast to the regular case the lengths of the p.p. segments interlacing with the bands tend asymptotically to a positive constant in the high-energy limit.

No abstract uploaded!

We study asymptotical behaviour of resonances for a quantum graph consisting of a finite internal part and external leads placed into a magnetic field, in particular, the question whether their number follows the Weyl law. We prove that the presence of a magnetic field cannot change a non-Weyl asymptotics into a Weyl one and vice versa. On the other hand, we present examples demonstrating that for some non-Weyl graphs the effective size of the graph, and therefore the resonance asymptotics, can be affected by the magnetic field.

Anderson mixing (AM) is a powerful acceleration method for fixed-point iterations, but its computation requires storing many historical iterations. The extra memory footprint can be prohibitive when solving high-dimensional problems in a resource-limited machine. To reduce the memory overhead, we propose a novel class of short-term recurrence AM methods (ST-AM). The ST-AM methods only store two previous iterations with cheap corrections. We prove that the basic version of ST-AM is equivalent to the full-memory AM in strongly convex quadratic optimization, and with minor changes it has local linear convergence for solving general nonlinear fixed-point problems. We further analyze the convergence properties of the regularized ST-AM for nonconvex (stochastic) optimization. Finally, we apply ST-AM to several applications including solving root-finding problems and training neural networks. Experimental results show that ST-AM is competitive with the long-memory AM and outperforms many existing optimizers.

In 2017, Ward Beullens et al. submitted Lifted Unbalanced Oil and Vinegar (LUOV) [4], a signature scheme based on the famous multivariate public key cryptosystem (MPKC) called Unbalanced Oil and Vinegar (UOV), to NIST for the competition for post-quantum public key scheme standardization. The defining feature of LUOV is that, though the public key P works in the extension field of degree r of F_2, the coefficients of P come from F_2. This is done to significantly reduce the size of P. The LUOV scheme is now in the second round of the NIST PQC standardization process. In this paper we introduce a new attack on LUOV. It exploits the “lifted” structure of LUOV to reduce direct attacks on it to those over a subfield. We show that this reduces the complexity below the targeted security for the NIST post-quantum standardization competition.