To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items 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 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.
This paper treats the multi-peg generalization of the Tower of Hanoi problem with n(≥ 1) disks and p(≥ 3) pegs, P1, P2,…, Pp. Denoting by M(n, p) the presumed minimum number of moves required to transfer the tower of n disks from the source peg, P1, to the destination peg, Pp, under the condition that each move transfers the topmost disk from one peg to another such that no disk is ever placed on top of a smaller one, the Dynamic Programming technique has been employed to find the optimality equation satisfied by M(n, p). Though an explicit expression for M(n, p) is given, no explicit expressions for the partition numbers (at which M(n, p) is attained) are available in the literature for p ≥ 5. The values of the partition numbers have been given in this paper.
A class of evolution equations in divergence form is studied in this paper. Specifically, we develop conditions under which the spatial divergence term, the flux, corresponds to the characteristic of a conservation law. The KdV equation is a prominent example of an equation having a flux term that is also a characteristic for a conservation law. We show that the flux term must be self-adjoint. General equations for the corresponding conservation laws and Hamiltonian densities are derived and supplemented with examples. 2000 Mathematics subject classification: primary 35K.
Vacuum asymptotically flat Robinson-Trautman spacetimes are a well known class of spacetimes exhibiting outgoing gravitational radiation. In this paper we describe a method of locating the past apparent horizon in these spacetimes and discuss the properties of the horizon. We show that the past apparent horizon is non-timelike and that its surface area is a decreasing function of the retarded time. A numerical simulation of the apparent horizon is also discussed.
An initial value problem is considered for impulsive functional-differential equations. The impulses occur at fixed moments of time. Sufficient conditions are found for Lipschitz stability of the zero solution of these equations. An application in impulsive population dynamics is also discussed.
The Mach-number series expansion of the potential function for the two-dimensional flow of an inviscid, compressible, perfect, diatomic gas past a circular cylinder is obtained to 29 terms. Analysis of this expansion allows the critical Mach number, at which flow first becomes locally sonic, to be estimated as M* = 0.39823780 ± 0.00000001. Analysis also permits the following estimate of the radius of convergence of the series for the maximum velocity to be made: Mc = 0.402667605 ± 0.00000005, though we have been unable to determine the nature of the singularity of M = Mc. Since Mc exceeds M* by some 1.1%, it follows that this particular “airfoil” can possess a continuous range of shock-free potential flows above the critical Mach number. This result hopefully resolves a 70-year old controversy.
This paper studies a class of impulsive switched systems with persistent bounded disturbance using robust attractor analysis and multiple Lyapunov functions. Some sufficient conditions for internal stability of the systems are obtained in terms of linear matrix inequalities (LMI). Based on the results, a simple approach for the design of a feedback controller is presented to achieve a desired level of disturbance attenuation. Numerical examples are also worked out to illustrate the obtained results.
We apply superadditivity and monotonicity properties associated with the Jensen discrete inequality to derive relationships between the entropy function of a probability vector and a renormalized arbitrary sub-vector. The results are extended to cover other entropy measures such as joint entropy, conditional entropy and mutual information.
Recently Dragomir and Goh have produced some interesting new bounds relating to entropy measures in information theory. We establish several refinements of their results.
Recent hypercircie estimates for non-linear equations are extended to include a new class of boundary value problems of monotone type. The results are illustrated by the boundary value problem for the equilibrium-free surface of a liquid with prescribed contact angle.
Bounds are presented for the modulus of the complex growth rate p of an arbitrary oscillatory perturbation, neutral or unstable, in some double-diffusive problems of relevance in oceanography, astrophysics and non-Newtonian fluid mechanics.
The long term asymptotic behaviour of a population is evaluated where the age specific fertility behaviour is allowed to change with time. Thus in this article the behaviour of a population is determined with a time dependent net maternity function. It is shown that methods used when the net maternity function was independent of time are still applicable if the change with time is explicit only for the initial population. Further, using the fact that for realistic situations the net maternity function is non-zero over a finite interval α < x < β, it is shown that traditional methods can again be used if the time dependence is associated with ages less than α, the minimum age of childbearing. Recent extensions of Cerone and Keane to include exponential time dependence are utilized and models are presented which are piecewise defined, allowing general and exponential time dependence for the parent and new-born populations respectively. The Sharpe-Lotka single sex determinstic population model is used as the basis for the analysis.
Over the past two decades considerable effort has been devoted to problems of stochastic stability, stabilisation, filtering and control for linear and nonlinear systems with Markovian jump parameters, and a number of results have been achieved. However, due to the exponential distribution of the Markovian chain, there are many restrictions on existing results for practical applications. In the present paper, we study systems whose jump parameters are semi-Markovian rather than fully Markovian. We consider only linear systems with semi-Markovian jump parameters, and also study systems with phase-type semi-Markovian jump parameters, because the family of phase-type distributions is dense in the families of all probability distributions on [0, +∞). Some stochastic stability results are obtained. An example is given to show the potential of the proposed techniques.
Let jν, denote the first positive zero of Jν. It is shown that jν/(ν + α) is a strictly decreasing function of ν for each positive α provided ν is sufficiently large. For each α lowe bounds on ν are given to assure the monotonicity of jν/(ν + α). From this it is shown that jν > ν + j0 for all ν > 0, which is both simpler and an improvement on the well known inequality Jν ≥ (ν (ν + 2))1/2.
In this paper the relations between semi-infinite programs and optimisation problems with finitely many variables and constraints are reviewed. Two classes of convex semi-infinite programs are defined, one based on the fact that a convex set may be represented as the intersection of closed halfspaces, while the other class is defined using the representation of the elements of a convex set as convex combinations of points and directions. Extension to nonconvex problems is given. A common technique of solving a semi-infinite program computationally is to derive necessary conditions for optimality in the form of a nonlinear system of equations with finitely many equations and unknowns. In the three-phase algorithm, this system is constructed from the optimal solution of a discretised version of the given semi-infinite program. i.e. a problem with finitely many variables and constraints. The system is solved numerically, often by means of some linearisation method. One option is to use a direct analog of the familiar SOLVER method.
This paper presents three theorems concerning stability and stationary points of the constrained minimization problem:
In summary, we prove that, given the Mangasarian-Fromovitz constraint qualification (MFCQ), the feasible set M[H, G] is a topological manifold with boundary, with specified dimension; (ℬ) a compact feasible set M[ H, G] is stable (perturbations of H and G produce homeomorphic feasible sets) if and only if MFCQ holds; under a stability condition, two lower level sets of f with a Kuhn-Tucker point between them are homotopically related by attachment of a k-cell (k being the stationary index in the sense of Kojima).