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.
Ramanujan's work on the asymptotic behaviour of the hypergeometric function has been recently refined to the zero-balanced Gaussian hypergeometric function F(a, b; a + b; x) as x→1.We extend these results for F(a, b; c; x) when a, b, c>0 and c<a + b.
For i = 1,…, n let ai be a homogeneous polynomial of degree ri(>0) in the graded polynomial ring R[x1, …, xm], or R[x] for short, where R is a commutative ring with unity and x1, …, xm are indeterminates of degree 1. Let of degree - 1 be a formal inverse of xj and let U denote the graded R[x]-module In [2, §2] we introduced a graded complex of r-modules.
A random polytope, Kn, is the convex hull of n points chosen randomly, independently, and uniformly from a convex body It is shown here that, with high probability, Kn can be obtained by taking the convex hull of m = o(n) points chosen independently and uniformly from a small neighbourhood of the boundary of K.
We show that a measure on ℝd is linearly rectifiable if, and only if, the lower l-density is positive and finite and agrees with the lower average l-density almost everywhere.
Given a p-subgroup P of a finite group G we express the number of p-blocks of G with defect group P as the p-rank of a symmetric integer matrix indexed by the N(P)/P-conjugacy classes in PC(P)/P. We obtain a combinatorial criterion for P to be a defect group in G.
The Gaussian algorithm for lattice reduction in dimension 2 is analysed under its standard version. It is found that, when applied to random inputs in a continuous model, the complexity is constant on average, its probability distribution decays geometrically, and the dynamics are characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, continued fractions, continuants, and functional operators. Analysis in the discrete model and detailed numerical data are also presented.
A particular solution to the biharmonic equation is described which represents a slow viscous flow near a sharp edge. It shows separation streamlines which are tangential to the plate at the edge, when the dominant behaviour there is a combination of the flow around the edge (which provides zero vorticity on the plate) plus a simple linear shear.
A relationship between a new and an old graph invariant is established. The first invariant is connected to the ‘sandglass conjecture’ of [1]. The second one is graph entropy, an information theoretic functional, which is already known to be relevant in several combinatorial contexts.
In this paper we carry out a linear stability analysis within the Stokes layer that, under suitable conditions, forms at the surface of a circular cylinder in periodic orbital motion. The analysis is related to that performed by Seminara [1,2] in the Stokes layer on a torsionally oscillating cylinder and by Hall [3] in the Stokes layer at the surface of a cylinder in purely oscillatory motion. In all cases we find that the minimum critical Taylor number is located where the flow at the edge of the Stokes layer has maximum speed in each period of the motion.
It is known that if A and B are nontriangular 2 × 2 non-negative integral matrices similar over the integers and –tr A ≤det A, then A and B are strongly shift equivalent. Suppose that A and B are 2 × 2 non-negative integral matrices similar over the integers. In this article it is shown that if –2 tr A≤det A <– tr A and if | det A | is not a prime, then A and B are strongly shift equivalent.
Let G=(V, E) be a simple connected graph of order [mid ]V[mid ]=n[ges ]2 and minimum degree δ, and let 2[les ]s[les ]n. We define two parameters, the s-average distance μs(G) and the s-average nearest neighbour distance Λs(G), with respect to each of which V contains an extremal subset X of order s with vertices ‘as spread out as possible’ in G. We compute the exact values of both parameters when G is the cycle Cn, and show how to obtain the corresponding optimal arrangements of X. Sharp upper and lower bounds are then established for Λs(G), as functions of s, n and δ, and the extremal graphs described.
Let W denote a positive, increasing and continuous function on [1, ∞]. We write to denote the Dirichlettype space of functions f that are holomorphic in the unit disc and for which
Where If W(x) = x for all x, then is the classicial Dirichlet space for which Note also that for every so, by Fatu's theoreum, every function in . ha finite radial(and angular) limits a.e. on the boundary of U. The question of the existence a.e. on ∂U of certain tangential limits for functions in has been considered in [6,11], but we shall be concerned here with the radial variation
i.e., the length of the image of the ray from 0 to eiθ under the mapping w = f(z), and, in particular, with the size of the set of values of θ for which Lf(θ) can be infinite when