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.
Huta [1], [2] has given two processes for solving a first order differential equation to sixth order accuracy. His methods are each eight stage Runge-Kutta processes and differ mainly in that the later process has simpler coefficients occurring in it.
If G is a finite linear group of degree n, that is, a finite group of automorphisms of an n-dimensional complex vector space (or, equivalently, a finite group of non-singular matrices of order n with complex coefficients), I shall say that G is a quasi-permutation group if the trace of every element of G is a non-negative rational integer. The reason for this terminology is that, if G is a permutation group of degree n, its elements, considered as acting on the elements of a basis of an n-dimensional complex vector space V, induce automorphisms of V forming a group isomorphic to G. The trace of the automorphism corresponding to an element x of G is equal to the number of letters left fixed by x, and so is a non-negative integer. Thus, a permutation group of degree n has a representation as a quasi-permutation group of degree n.
We consider a single server queueing system in which customers arrive at the instants t0, t1, …, tm, …. We write τm = tm+1 − tm, m ≧ 0. There is a single server with distribution of service times B(x) given by where k is an integer not less than unity.
Let G be an n-generator group and let g = (g1, g2, …, gn) be an ordered set of n elements which generate G, then g is called a generating n-vector of G. Let denote the set of all generating n-vectors of G.
Throughout this paper E, F and G denote separated locally convex spaces, F C G, the injection i: F → G being continuous (i.e. the topology on F is finer than that induced on it by the topology on G). E′, F′ and G′ denote the respective duals of E, F and G. i′ is the adjoint map of G′ into F', which is defined by restricting linear forms on G to F C G.
We consider a set of η first order simultaneous differential equations in the dependent variables y1, y2, …, yn and the independent variable x ⋮ No loss of gernerality results from taking the functions f1, f2, …, fn to be independent of x, for if this were not so an additional dependent variable yn+1, anc be introduced which always equals x and thus satisfies the differential equation
A mathematical theory is developed which enables the wind-tunnel corrections to the lift and moment forces acting on an aerofoil in subsonic two-dimensional flow to be calculated. The usual “averaged” boundary condition for slotted walls is assumed and the corrections obtained by successive approximation from the open-jet tunnel.
Given two topologies J1, J2 on a set X, J1 is said to be coarser than J2, written J1 ≦ J2, if every set open under J1 is open under J2. A minimal Hausdorff space is then one for which there is no coarser Hausdorff topology etc. Vaidyanathaswamy [4] showed that every compact Hausdorff space is both maximal compact and minimal Hausdorff. This raised the question of whether there exist minimal Hausdorff non-compact spaces and/or maximal compact non-Hausdorff spaces. These questions were in fact answered in the affirmative by Ramanathan [2], Balachandran [1], and Hing Tong [3]. Their examples were, however, all on countable sets, and the topology constructed to answer one question bore no relation to the topology answering the second. In particular, the minimal Hausdorff non-compact topologies were not finer than any maximal compact topology.
When a semi-infinite line load moves lengthways, at supersonic velocity, on the plane surface of an elastic solid, the resulting velocity field is conical. There are two characteristic cones, one associated with dilatation effects and the other with shear effects. The propagation process is more complicated than the well-known case of conical flow in supersonic aerodynamics not only because of the presence of two cones of discontinuity but also because the presence of a free surface implies interaction between shear and dilatation effects. It is the interaction process at the free surface which is examined in detail in this paper.
The results of this fundamental problem may be extended by the process of superposition to more general steadily moving loads. In particular by differentiating with respect to time, the potential of a steadily moving point load is obtained explicitly.
Milne-Thomson has used the method of analytic continuation to solve boundary value problems of the annulus in plane elastostatics. However, his use of Cauchy integrals is incorrect, and it is shown in this note that the solution is obtained in terms of Laurent Series expansions. The solution is equivalent to that of Muskhelishvili, but is simpler to use in some applications.
A similar approach is used to solve the boundary value problem of the infinite strip, the solution being given in terms of functions of a complex variable expressed as Fourier integrals.
The random processes discussed here may be specified in the following way. A fixed population of N members is spilt into two distinct classes. Individuals move about randomly between the classes, and we are interested in the size of each class at any time, rather than in the behaviour of particular individuals. Let i(t) and N —i(t) be the numbers present in the repective classes at the time t. It is assumed that the process {i(t), t ≧ 0} is Markovian, and that transitions between the states j = 0, 1, … N, occur according to the conditional probabilities; and.
A tetrad of Möbius tetrahedra consists of a set of 4 mutually inscribed and therefore circumscribed tetrahedra whose 16 vertices and 16 faces form a Kummer's 166 configuration (5; 11; 12; 21). As pointed out by the refere, fundamental to all work on the 166 figure are the 10 quadrics, called fundamental for the associated Kummer's quartic surface (13). To every quadric F correspond a matrix scheme of the 16 points or planes, arranged in 4 rows or columns, such that the 8 Rosenhain tetrahedra (7) formed of the rows and columns are all self-polar for F. The rows form one and the columns another tetrad of Mobius tetrahedra. Nine new schemes can be derived from one such scheme to make the total ten as explained by Baker (3, p. 133) leading to 80 Rosenhain tetrahedra in all. The 16 nodes (5; 8) or tropes of the Rummer's quartic are the 16 common elements of the 10 schemes such that the nodes and tropes are poles and polars for any one of the 10 quadrics. Each trope touches the quartic along a singular conic through the 6 points of the figure lying therein. The lines tangent to the surface at its each node N generate a quadric cone which is enveloped by the 6 tropes through N (12).
Let G be a finite group. If N denotes a normal subgroup of G, a subgroup S of G is called a supplement of N if we have G = SN. For every normal subgroup of G there is always the trivial supplement S = G. The existence of a non-trivial supplement is important for the extension theory, i.e., for the description of G by means of N and the factor group G/N. Generally, a supplement S is the more useful the smaller the intersection S ∩ N. If we have even S ∩ N = 1, then S is called a complement for N in G. In this case G is a splitting extension of N by S.
It is known that various cases of the steady isentropic irrotational motion of a compressible fluid are expressible as variational principle [1], [5]. in particular, the aerofoil problem i.e. the case of plane flow in which a uniform stream is locally deflected, without circulation, by a bounded obstacle, can be expressed in such a form. Thus we make stationary where the region R is that bounded internally by the obstacle (C0) and externally by a circle (CR) of radius R. In this expression φ∞ is the velocity potential for a uniform stream, and φ0 is the velocity potential for the corresponding incompressible flow.
When n objects are to be compared in pairs, a complete experiment requires N= comparisons. There are frequent occasions when it si desirable to make only a fraction F of the possible comparison, either because N is large or because even an individual comparison is laborious. The problem of what constitutes a satisfactory subset of the comparisons has been considered by Kendall [5[ who lays down the following two minimum requirements: (a) every object should appear equally often; (b) the design should be ‘connected‘ so that it is impossible to split the objects into two sets with no comparison made between objects in one set and objects in the other.