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.

A vast class of exponential functions are shown to be deterministic. This class includes functions whose exponents are polynomial-like or ``piece-wise'' close to polynomials after differentiation. Many of these functions are proved to be disjoint from the M\"obius function.

We give new examples of hyperbolic and relatively hyperbolic groups of cohomological dimension d for all d ≥ 4 (see Theorem 2.13). These examples result from applying CAT(0)/CAT(−1) filling constructions (based on singular doubly warped products) to finite volume hyperbolic manifolds with toral cusps. The groups obtained have a number of interesting properties, which are established by analyzing their boundaries at infinity by a kind of Morse-theoretic technique, related to but distinct from ordinary and combinatorial Morse theory (see Section 5).

This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three dimensional photonic crystals with face centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of $5.184$ million dimension eigenvalue problems within $50$ to $104$ minutes on a workstation with two Intel Quad-C ore Xeon X5687 3.6 GHz CPUs.

No abstract uploaded!