TY - JOUR AB - We consider a dilute, homogeneous Bose gas at positive temperature. The system is investigated in the Gross–Pitaevskii limit, where the scattering length a is so small that the interaction energy is of the same order of magnitude as the spectral gap of the Laplacian, and for temperatures that are comparable to the critical temperature of the ideal gas. We show that the difference between the specific free energy of the interacting system and the one of the ideal gas is to leading order given by 4πa(2ϱ2−ϱ20). Here ϱ denotes the density of the system and ϱ0 is the expected condensate density of the ideal gas. Additionally, we show that the one-particle density matrix of any approximate minimizer of the Gibbs free energy functional is to leading order given by the one of the ideal gas. This in particular proves Bose–Einstein condensation with critical temperature given by the one of the ideal gas to leading order. One key ingredient of our proof is a novel use of the Gibbs variational principle that goes hand in hand with the c-number substitution. AU - Deuchert, Andreas AU - Seiringer, Robert ID - 7650 IS - 6 JF - Archive for Rational Mechanics and Analysis SN - 0003-9527 TI - Gross-Pitaevskii limit of a homogeneous Bose gas at positive temperature VL - 236 ER - TY - JOUR AB - We study the dynamics of a system of N interacting bosons in a disc-shaped trap, which is realised by an external potential that confines the bosons in one spatial dimension to an interval of length of order ε. The interaction is non-negative and scaled in such a way that its scattering length is of order ε/N, while its range is proportional to (ε/N)β with scaling parameter β∈(0,1]. We consider the simultaneous limit (N,ε)→(∞,0) and assume that the system initially exhibits Bose–Einstein condensation. We prove that condensation is preserved by the N-body dynamics, where the time-evolved condensate wave function is the solution of a two-dimensional non-linear equation. The strength of the non-linearity depends on the scaling parameter β. For β∈(0,1), we obtain a cubic defocusing non-linear Schrödinger equation, while the choice β=1 yields a Gross–Pitaevskii equation featuring the scattering length of the interaction. In both cases, the coupling parameter depends on the confining potential. AU - Bossmann, Lea ID - 8130 IS - 11 JF - Archive for Rational Mechanics and Analysis SN - 0003-9527 TI - Derivation of the 2d Gross–Pitaevskii equation for strongly confined 3d Bosons VL - 238 ER - TY - JOUR AB - We consider the Fröhlich model of a polaron, and show that its effective mass diverges in thestrong coupling limit. AU - Lieb, Elliott H. AU - Seiringer, Robert ID - 7235 JF - Journal of Statistical Physics SN - 0022-4715 TI - Divergence of the effective mass of a polaron in the strong coupling limit VL - 180 ER - TY - CONF AB - For 1≤m≤n, we consider a natural m-out-of-n multi-instance scenario for a public-key encryption (PKE) scheme. An adversary, given n independent instances of PKE, wins if he breaks at least m out of the n instances. In this work, we are interested in the scaling factor of PKE schemes, SF, which measures how well the difficulty of breaking m out of the n instances scales in m. That is, a scaling factor SF=ℓ indicates that breaking m out of n instances is at least ℓ times more difficult than breaking one single instance. A PKE scheme with small scaling factor hence provides an ideal target for mass surveillance. In fact, the Logjam attack (CCS 2015) implicitly exploited, among other things, an almost constant scaling factor of ElGamal over finite fields (with shared group parameters). For Hashed ElGamal over elliptic curves, we use the generic group model to argue that the scaling factor depends on the scheme's granularity. In low granularity, meaning each public key contains its independent group parameter, the scheme has optimal scaling factor SF=m; In medium and high granularity, meaning all public keys share the same group parameter, the scheme still has a reasonable scaling factor SF=√m. Our findings underline that instantiating ElGamal over elliptic curves should be preferred to finite fields in a multi-instance scenario. As our main technical contribution, we derive new generic-group lower bounds of Ω(√(mp)) on the difficulty of solving both the m-out-of-n Gap Discrete Logarithm and the m-out-of-n Gap Computational Diffie-Hellman problem over groups of prime order p, extending a recent result by Yun (EUROCRYPT 2015). We establish the lower bound by studying the hardness of a related computational problem which we call the search-by-hypersurface problem. AU - Auerbach, Benedikt AU - Giacon, Federico AU - Kiltz, Eike ID - 7966 SN - 0302-9743 T2 - Advances in Cryptology – EUROCRYPT 2020 TI - Everybody’s a target: Scalability in public-key encryption VL - 12107 ER - TY - CONF AB - We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers. AU - Henzinger, Thomas A AU - Sarac, Naci E ID - 8623 SN - 0302-9743 T2 - Runtime Verification TI - Monitorability under assumptions VL - 12399 ER -