In these notes, we provide an introduction to the hemisphere partition function of 2d (2, 2) supersymmetric gauge theories, and discuss its relation to the “D-brane central charge” which were studied in superstring theory, in 2d supersymmetric quantum field theory, and in topological string theory. We also discuss relation to “macroscopic loop” in matrix models. They are mostly reviews of the work by the authors, but contains some new results such as the partition function for a rotated supersymmetry as well as the differential equations.

We give a method for constructing transcendental entire functions with good control of both the singular values of$f$and the geometry of$f$. Among other applications, we construct a function$f$with bounded singular set, whose Fatou set contains a wandering domain.

No abstract uploaded!

This paper concerns the well-posedness theory of the motion of a physical vacuum for the compressible Euler equations with or without self-gravitation. First, a general uniqueness theorem of classical solutions is proved for the three dimensional general motion. Second, for the spherically symmetric motions, without imposing the compatibility condition of the first derivative being zero at the center of symmetry, a new local-in-time existence theory is established in a functional space involving less derivatives than those constructed for three-dimensional motions in (Coutand et al., Commun Math Phys 296:559–587, 2010; Coutand and Shkoller, Arch Ration Mech Anal 206:515–616, 2012; Jang andMasmoudi,Well-posedness of compressible Euler equations in a physical vacuum, 2008) by constructing suitable weights and cutoff functions featuring the behavior of solutions near both the center of the symmetry and the moving vacuum boundary.

Research on key mismatch attacks against lattice-based KEMs is an important part of the cryptographic assessment of the ongoing NIST standardization of post-quantum cryptography. There have been a number of these attacks to date. However, a unified method to evaluate these KEMs’ resilience under key mismatch attacks is still missing. Since the key index of efficiency is the number of queries needed to successfully mount such an attack, in this paper, we propose and develop a systematic approach to find lower bounds on the minimum average number of queries needed for such attacks. Our basic idea is to transform the problem of finding the lower bound of queries into finding an optimal binary recovery tree (BRT), where the computations of the lower bounds become essentially the computations of a certain Shannon entropy. The optimal BRT approach also enables us to understand why, for some lattice-based NIST candidate KEMs, there is a big gap between the theoretical bounds and bounds observed in practical attacks, in terms of the number of queries needed. This further leads us to propose a generic improvement method for these existing attacks, which are confirmed by our experiments. Moreover, our proposed method could be directly used to improve the side-channel attacks against CCA-secure NIST candidate KEMs.