We study the three dimensional quantum many-body dynamics with a delta-type potential N3β V(N β x) and a Coulomb potential. As the particle number N tends to infinity and the Planck’s constant ħ tends to zero independently, we prove the weak convergence of the quantum mass and momentum densities to the Euler–Poisson equation with the pressure before its blow-up time. The proof is based on the modulated energy method in the setting of the quantum many-body dynamics, for which the key is a quantum functional inequality according to the interaction potentials. In Golse–Paul [Comm. Pure Appl. Math., 2022, 75(6): 1332–1376], the functional inequality for the Coulomb potential is achieved based on Serfaty’s inequality [Duke Math. J., 2020, 169(15): 2887–2935]. In the mean-field regime
Ahlfors’ Second Fundamental Theorem for the simply connected surfaces over the Riemann sphere S states that for any set E q of distinct q points on S with q ≥ 3, there exists a constant h = h(E q), such that for any covering surface
For any positive integer n, let σ(n) be the sum of all positive divisors of n. For any prime p and any positive integer m, let ν p(m) be the largest integer α such that p α ∣ m. Recently, Amdeberhan, Moll, Sharma and Villamizar proved that for any odd prime p and any integer n ≥ 2, ν p(σ(n) ≤ [log p n] if n satisfies some conditions, where [x] denotes the least integer not less than x. In this paper, for any odd prime p, we prove that ν p(σ(n) ≤ [log p n] for all positive integers n unconditionally. Moreover, we prove that if 3 ≤ p < 105 is a prime and p ≠ 31, then there are only finitely many positive integers n such that ν p(σ(n) = [log p n]. For p = 31 and n ≥ 2, ν p(σ(n) = [log p n] if and only if n = 24, 52, 2452 and 2452(2 · 31 s − 1), where s is a positive integer and 2 · 31 s − 1 is a prime.
Using the saddle point theorem and the mountain pass theorem with Morse index estimate, the existence of periodic solutions for second-order Hamiltonian systems with mild superquadratic growth is proved in this paper. Meanwhile the existence result of homoclinic orbits for this kind of Hamiltonian systems is also obtained by the local convergence of a sequence of subharmonic solutions.
In this paper, we compute the rational cohomology groups of the classifying space of a simply connected Kac–Moody group of infinite type. The fundamental principle is “from finite to infinite”. That is, for a Kac–Moody group G(A) of infinite type, the input data for computation are the rational cohomology of classifying spaces of parabolic subgroups of G(A)(which are of finite type), and the homomorphisms induced by inclusions of these subgroups. In some special cases, we can further determine the cohomology rings. Our method also applies to study the mod p cohomology of the classifying spaces of Kac–Moody groups.
Let
The work concerns multivalued McKean–Vlasov stochastic differential equations. First of all, we prove the existence and uniqueness of strong solutions for multivalued McKean–Vlasov stochastic differential equations with non-Lipschitz coefficients. Then, the classical Itô’s formula is extended to that for multivalued McKean–Vlasov stochastic differential equations. Finally, the asymptotic stability of second moments and the almost surely asymptotic stability for their solutions in terms of a Lyapunov function are shown.
A birth-death process (abbr. BDP) on trees is a time-continuous and homogeneous random walk in which the transition rate from any state to its father is called death rate and the ones to its offspring are called birth rates. In this paper, we obtain explicit uniqueness and recurrence criteria for BDPs on trees. Meanwhile, we also get an explicit and recursive representation for moments of integral-type functionals for this process. We then study the uniqueness and recurrence for some specific examples of BDPs on trees and apply integral-type functionals’ results to more general integral-type functionals. Moreover, polynomial ergodicity is derived and a sufficient condition for a central limit theorem is also obtained.