We partner with a secure submission system to handle manuscript submissions.
Please note:
You will need an account for the submission system, which is separate to your Cambridge Core account. For login and submission support, please visit the
submission and support pages.
Please review this journal's author instructions, particularly the
preparing your materials
page, before submitting your manuscript.
Click Proceed to submission system to continue to our partner's website.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The discrete random walk problem for the unrestricted particle formulated in the double diffusion model given in Hill [2] is solved explicitly. In this model it is assumed that a particle moves along two distinct horizontal paths, say the upper path I and lower path 2. For i = 1, 2, when the particle is in path i, it can move at each jump in one of four possible ways, one step to the right with probability pi, one step to the left with probability qi, remains in the same position with probability ri, or exchanges paths but remains in the same horizontal position with probability si (pi + qi + ri + si = 1). Using generating functions, the probability distribution of the position of an unrestricted particle is derived. Finally some special cases are discussed to illustrate the general result.
For a set function G on an atomless finite measure space (X, , m), we define the subgradient, conjugate set of and conjugate functional of G. It is proved that a minimization problem of set function G has an optimal solution if and only if the Lagrangian on × L1(X, , m)has a saddle point (Ω0, f0) such that
where f0 is an element of the conjugate set (for the definition, see the later context).
This paper shows how to compute the trace of G(T) – G(T0), where G is an infinitely differentiable function with compact support, and where T and T0 are one-dimensional Schrödinger operators on (−∞, ∞) with potentials q and q0. It is assumed that q0 is a simple step potential and that q decays exponentially to q0. The trace is expressed in terms of the reflection and transmission coefficients for the scattering of plane waves by the potential q.
Sufficient conditions are obtained for the existence of a unique asymptotically stable periodic solution for the Lotka-Volterra two species competition system of equations when the intrinsic growth rates are periodic functions of time.
The movement of the interface between two immiscible fluids flowing through a porous medium is discussed. It is assumed that one of the fluids, which is a liquid, is much more viscous than the other. The problem is transformed by replacing the pressure with an integral of pressure with respect to time. Singularities of pressure and the transformed variable are seen to be related.
Some two-dimensional problems may be solved by comparing the singularities of certain analytic functions, one of which is derived from the new variable. The implications of the approach of a singularity to the moving boundary are examined.
A chain reaction of oxygen (reactant) and hydrogen (active intermediary) with mtrosyl chloride (sensitizer) as a catalyst may be modelled mathematically as a non-isothermal reaction. In this paper we present an asymptotic analysis of a spatially homogeneous model of a non-isothermal branched-chain reaction. Of particular interest is the so-called explosion time and we provide an upper bound for it as a function of the activation energy which can vary over all positive values. We also establish a bound on the temperature when the activation energy is finite.
A method for solving quasilinear parabolic equations of the types
that differs radically from previously known methods is proposed. For each initial-boundary-value problem of one of these types that has boundary conditions of the first kind (second kind), a conjugate initial-boundary-value problem of the other type that has boundary conditions of the second kind (first kind) is defined. Based on the relations connecting the solutions of a pair of conjugate problems, a series of parabolic equations with constant coefficients that do not change step to step is constructed. The method proposed consists in calculating the solutions of the equations of this series. It is shown to have linear convergence. Results of a series of numerical experiments in a finite-difference setting show that one particular implementation of the proposed method has a smaller domain of convergence than Newton's method but that it sometimes converges faster within that domain.
In this work the asymptotic behavior of the partial sums of the divergent asymptotic moment series , where μi are the moments of the weight functions w(x) = xαe−x, α > −1, and w(x) = xαEm (x), α > −1, m + α > 0, on the interval [0, ∞), is analyzed. Expressions for the converging factors are derived by the author for the infinite range integras with w(x) as given above.
A simple algebraic method is presented to determine the necessary condition for the existence of a Hamiltonian circuit in a directed graph of n vertices. A search procedure is then introduced to identify any or all of the existing Hamiltonian circuits. The procedure is based upon finding a set of edges which will then be candidates for being parts of circuits of length n at any vertex of the graph.