No abstract uploaded!

Consider an age-dependent, single-species branching process defined by a progeny number distribution, and a lifetime distribution associated with each independent particle. In this paper, we focus on the associated inverse problem where one wishes to formally solve for the progeny number distribution or the lifetime distribution that defines the Bellman-Harris branching process. We derive results for the existence and uniqueness (the identifiability) of these two distributions given one of two types of information: the extinction time probability of the entire process (extinction time distribution), or the distribution of the total number of particles at one fixed time. We demonstrate that perfect knowledge of the distribution of extinction times allows us to formally determine either the progeny number distribution or the lifetime distribution. Furthermore, we show that these constructions are unique. We then consider “data” consisting of a perfectly known total number distribution given at one specific time. For a process with known progeny number distribution and exponentially distributed lifetimes, we show that the rate parameter is identifiable. For general lifetime distributions, we also show that the progeny distribution is globally unique. Our results are presented through four theorems, each describing the constructions in the four distinct cases.

We define a hierarchy of Hamiltonian PDEs associated to an arbitrary tau-function in the semi-simple orbit of the Givental group action on genus expansions of Frobenius manifolds. We prove that the equations, the Hamiltonians, and the bracket are weightedhomogeneous polynomials in the derivatives of the dependent variables with respect to the space variable. In the particular case of a conformal (homogeneous) Frobenius structure, our hierarchy coincides with the Dubrovin–Zhang hierarchy that is canonically associated to the underlying Frobenius structure. Therefore, our approach allows to prove the polynomiality of the equations, Hamiltonians, and one of the Poisson brackets of these hierarchies, as conjectured by Dubrovin and Zhang.

No abstract uploaded!

We present novel algorithms for compressible flows that\n\nare efficient for all Mach numbers. The approach is based on several\n\ningredients: semi-implicit schemes, the gauge decomposition\n\nof the velocity field and a second order formulation of the density\n\nequation (in the isentropic case) and of the energy equation (in\n\nthe full Navier-Stokes case). Additionally, we show that our approach\n\ncorresponds to a micro-macro decomposition of the model,\n\nwhere the macro field corresponds to the incompressible component\n\nsatisfying a perturbed low Mach number limit equation and\n\nthe micro field is the potential component of the velocity. Finally,\n\nwe also use the conservative variables in order to obtain a proper\n\nconservative formulation of the equations when the Mach number\n\nis order unity. We successively consider the isentropic case, the\n\nfull Navier-Stokes case, and the isentropic Navier-Stokes-Poisson\n\ncase. In this work, we only concentrate on the question of the\n\ntime discretization and show that the proposed method leads to\n\nAsymptotic Preserving schemes for compressible flows in the low\n\nMach number limit.