The Global Dimension of Rings of Differential Operators on Projective Spaces

We compute the global dimension of the twisted rings of globaldifferential operators D on complex projective n-space. As varies through the complex numbers, this global dimension takeson the values n, 2n and infinity. We also study the embeddingof D in the Weyl algebra A_n in the cases when the global dimensionis infinite. In these cases, we see that the flat dimensionof A_n as a D-module is infinite as well.     

A Solution for the Embedding Problem for Partial Transitive Triple Systems

In this paper we solve the embedding problem for partial transitivetriple systems of order n and index , partial TTS(n, ) s, showingthat any partial TTS(n, ) can be embedded in a TTS(v, ) forall -admissible v 2n + 1. This lower bound on v is the bestpossible. A simple proof is also given of a result of Colbournand Harms which shows that every partial triple system of ordern and index 2 is the underlying triple system of a partial TTS(n,). 1991 Mathematics Subject Classification 05B07.     

The eigenvalues of limits of radial Toeplitz operators

Let A² be the Bergman space on the unit disk. A bounded operatorS on A² is called radial if Szⁿ = _n zⁿ for all n 0, where _nis a bounded sequence of complex numbers. We characterize theeigenvalues of radial operators that belong to the Toeplitzalgebra.     

A New Notion of Transitivity for Groups and Sets of Permutations

Let = {1, 2, ..., n} where n 2. The shape of an ordered setpartition P = (P₁, ..., P_k) of is the integer partition =(₁, ..., _k) defined by _i = |P_i|. Let G be a group of permutationsacting on . For a fixed partition of n, we say that G is -transitiveif G has only one orbit when acting on partitions P of shape. A corresponding definition can also be given when G is justa set. For example, if = (n – t, 1, ..., 1), then a -transitivegroup is the same as a t-transitive permutation group, and if = (n – t, t), then we recover the t-homogeneous permutationgroups. We use the character theory of the symmetric group S_n to establishsome structural results regarding -transitive groups and sets.In particular, we are able to generalize a celebrated resultof Livingstone and Wagner [Math. Z. 90 (1965) 393–403]about t-homogeneous groups. We survey the relevant examplescoming from groups. While it is known that a finite group ofpermutations can be at most 5-transitive unless it containsthe alternating group, we show that it is possible to constructa nontrivial t-transitive set of permutations for each positiveinteger t. We also show how these ideas lead to a combinatorialbasis for the Bose–Mesner algebra of the association schemeof the symmetric group and a design system attached to thisassociation scheme.     

Rate of convergence of numerical approximations to homoclinic bifurcation points

For x=f (x, ), x Rⁿ, R, having a hyperbolic or semihyperbolicequilibrium p(), we study the numerical approximation of parametervalues ^* at which there is an orbit homoclinic to p(). We approximate^* by solving a finite-interval boundary value problem on J=[T_–,T₊], T_–<0<T₊, with boundary conditions that sayx(T_–) and x(T₊) are in approximations to appropriate invariantmanifolds of p(). A phase condition is also necessary to makethe solution unique. Using a lemma of Xiao-Biao Lin, we improve,for certain phase conditions, existing estimates on the rateof convergence of the computed homoclinic bifurcation parametervalue , to the true value ^*. The estimates we obtain agree withthe rates of convergence observed in numerical experiments.Unfortunately, the phase condition most commonly used in numericalwork is not covered by our results.     

Higher correlations of divisor sums related to primes II: variations of the error term in the prime number theorem

We calculate the triple correlations for the truncated divisorsum _R(n). The _R(n) behave over certain averages just as theprime counting von Mangoldt function (n) does or is conjecturedto do. We also calculate the mixed (with a factor of (n)) correlations.The results for the moments up to the third degree, and thereforethe implications for the distribution of primes in short intervals,are the same as those we obtained (in the first paper with thistitle) by using the simpler approximation _R(n). However, when_R(n) is used, the error in the singular series approximationis often much smaller than what _R(n) allows. Assuming the GeneralizedRiemann Hypothesis (GRH) for Dirichlet L-functions, we obtainan _±-result for the variation of the error term in theprime number theorem. Formerly, our knowledge under GRH wasrestricted to -results for the absolute value of this variation.An important ingredient in the last part of this work is a recentresult due to Montgomery and Soundararajan which makes it possiblefor us to dispense with a large error term in the evaluationof a certain singular series average. We believe that our resultson the sums _R(n) and _R(n) can be employed in diverse problemsconcerning primes.     

The Model Plasma Problem: Existence of a Solution Branch

We are interested in the model plasma problem –u = u⁺in ,u = –d on , _au⁺ dx=j where is a bounded domain in with boundary ; here, j isa given positive number, the function u and the positive number are the unknowns of the problem, and d is a real parameter.Using a variant of the implicit function theorem, we can provethe existence of a global solution branch parametrized by d.The method has the advantage that it can be used for analysingthe approximation of the above problem by a finite-element method.     

On Decomposition Numbers and Branching Coefficients for Symmetric and Special Linear Groups

In this paper we find the multiplicities dim L()_– where is an arbitrary root and L() is an irreducible SL_n-module withhighest weight . We provide different bases of the correspondingweight spaces and outline some applications to the symmetricgroups. In particular we describe certain composition multiplicitiesin the modular branching rule. 1991 Mathematics Subject Classification:20C05, 20G05.     

LABELLING THE CHARACTER TABLES OF SYMMETRIC AND ALTERNATING GROUPS

Let X be a character table of the symmetric group S_n. It isshown that unless n = 4 or n = 6, there is a unique way to assignpartitions of n to the rows and columns of X so that for all and , X is equal to (), the value of the irreducible characterof S_n labelled by on elements of cycle type . Analogous resultsare proved for alternating groups, and for the Brauer charactertables of symmetric and alternating groups.     

A Krylov subspace algorithm for multiquadric interpolation in many dimensions

We consider the version of multiquadric interpolation wherethe interpolation conditions are the equations s(x_i) = f_i, i= 1,2,..., n, and where the interpolant has the form s(x) =_j=1ⁿ _j (||x – x_j ||² + c²)^1/2 + x R^d, subject to theconstraint _j=1ⁿ _j = 0. The points x_i R^d, the right-hand sidesf_i, i = 1,2,...,n, and the constant c are data. The equationsand the constraint define the parameters _j, j = 1,2,...,n, and. The resultant approximation s f is useful in many applications,but the calculation of the parameters by direct methods requiresO (n³) operations, and n may be large. Therefore iterative proceduresfor this calculation have been studied at Cambridge since 1993,the main task of each iteration being the computation of s(x_i),i = 1,2,...,n, for trial values of the required parameters.These procedures are based on approximations to Lagrange functions,and often they perform very well. For example, ten iterationsusually provide enough accuracy in the case d = 2 and c = 0,for general positions of the data points, but the efficiencydeteriorates if d and c are increased. Convergence can be guaranteedby the inclusion of a Krylov subspace technique that employsthe native semi-norm of multiquadric functions. An algorithmof this kind is specified, its convergence is proved, and carefulattention is given to the choice of the operator that definesthe Krylov subspace, which is analogous to pre-conditioningin the conjugate gradient method. Finally, some numerical resultsare presented and discussed, for values of d and n from theintervals [2,40] and [200,10 000], respectively.     

On a Functional Differential Equation

This paper considers some analytical and numerical aspects ofthe problem defined by an equation or systems of equations ofthe type (d/dt)y(t) = ay(t)+by(t), with a given initial conditiony(0) = 1. Series, integral representations and asymptotic expansions fory are obtained and discussed for various ranges of the parametersa, b and (> 0), and for all positive values of the argumentt. A perturbation solution is constructed for |1–| <<1, and confirmed by direct computation. For > 1 the solutionis not unique, and an analysis is included of the eigensolutionsfor which y(0) = 0. Two numerical methods are analysed and illustrated. The first,using finite differences, is applicable for < 1, and twotechniques are demonstrated for accelerating the convergenceof the finite-difference solution towards the true solution.The second, an adaptation of the Lanczos method, is applicablefor any > 0, though an error analysis is available onlyfor < 1. Numerical evidence suggests that for > 1 themethod still gives good approximations to some solution of theproblem.     

Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems

This paper gives an overview of matrix transformations for findingrightmost eigenvalues of Ax = x and Ax = Bx with A and B realnon-symmetric and B possibly singular. The aim is not to presentnew material. but to introduce the reader to the applicationof matrix transformations to the solution of large-scale eigenvalueproblems. The paper explains and discusses the use of Chebyshevpolynomials and the shift–invert and Cayley transformsas matrix transformations for problems that arise from the discretizationof partial differential equations. A few other techniques aredescribed. The reliability of iterative methods is also dealtwith by introducing the concept of domain of confidence or trustregion. This overview gives the reader an idea of the benefitsand the drawbacks of several transformation techniques. We alsobriefly discuss the current software situation.     

The Decay of Eddy-currents in Thin Sheets and Related Water-wave Problems

The decay of the eddy-currents that are induced in a thin, uniform,imperfectly-conducting sheet by switching off the source ofan external magnetic field is investigated. For the two-dimensionalproblem of an infinite strip the (non-dimensional) decay constants_n and eddy-current distributions i_n(x) are the eigenvalues andeigenfunctions of the integral equation with the constraint. For the circular disc the corresponding equation is where and K and E are complete elliptic integrals. For both problemsthe initial eddy-currents have inverse-square-root singularitiesat the edges but during their decay the eddy currents are finiteat the edges and the normal magnetic fields have logarithmicsingularities there. Numerical results are given for variousinitial-value problems. The eddy current problems are closely related to water-waveproblems in which there is a strip-shaped or circular aperturein a horizontal rigid dock. If _n and _n are the decay constantsand magnetic scalar potentials for the strip and _n and _n theangular frequencies and velocity potentials for the normal modesin the strip-shaped aperture, then _n =_n² and _n and _n are thereal and imaginary parts respectively of a holomorphic function.The velocities in the normal modes are deduced from the solutionof the eddy-current problem and are found to agree with resultsgiven in Miles (1972). For circular geometries the eigenvaluesand eigenfunctions of the axisymmetric eddy-current problemare the same as those of the water-wave problem that has angularvariation eⁱ; where (, , z) are cylindrical polar co-ordinateslocated at the centre of the basin.     

Oscillation theory and numerical solution of fourth-order Sturm--Liouville problems

A shooting method is developed to approximate the eigenvaluesand eigenfunc-tions of a fourth-order Sturm-Liouville problem.The main tool is a miss-distance function M(), which countsthe number of eigenvalues less than A. The method approximatesthe coefficients of the differential equation by piecewise-constantfunctions, which enables an exact solution to be found on eachmesh interval. In order to calculate N() for the approximateproblem, certain oscillation numbers N_L and N_R must be computed.These consist of sums of nullities (or rank deficiencies) of2 x 2 matrices obtained from the solutions of the approximatedifferential equation. Although these solutions can be foundexplicitly, the calculation of N_L and N_R is non-trivial, andis obtained by using certain properties of M().     

The Convergence of Operator Approximations at Turning Points

Present address: Department of Mathematics, University of Reading, Reading RG6 2AX. We consider the convergence of solution curves of approximationsto parameter-dependent operator equations of the form G(, x)= 0. Provided G_x(, x) remains non-singular this problem is cateredfor by a simple extension to standard theory. In this paper,however, attention is concentrated on solution curves throughcertain singular points (⁰, x⁰), and the main result is thatconvergence depends on consistency and stability results forthe linear eigenvalue problem G_x(⁰, x⁰)0 = 0.     

On the Length of Snakes in Powers of Complete Graphs

The conjecture stated in an earlier paper by the author thatthere is a constant (independent from both n and k) such that n^d–1 holds for everyn 2 and d 2, where is the length of the longest snake (cycle without chords) in the Cartesianproduct of d copies of thecomplete graph K_n, is proved.     

Cocroissance Des Groupes A Petite Simplification

Let be a group presented by e₁,...,e_m|r₁,...,r_k, L the freegroup generated by e₁,...,e_m, and N = Ker(L). Let c_n be thenumber of elements of length n in N. We know that c = lim sup(c_n)^1/n exists and that (2m–1) < c 2m – 1. ifN {1}. We prove that if the group satisfies a condition slightlyweaker than the small cancellation condition C^'() with <1/6, then c(2m–1) when the lengths of the relations r_itend to infinity. A consequence of this result is a theoremof Grigorchuk.     

Supercyclic Subspaces

A bounded operator T acting on a Banach space B is said to besupercyclic if there is a vector x B such that the projectiveorbit {Tⁿx : n 0 and C} is dense in B. Examples of supercyclicoperators are hypercyclic operators, in which the orbit itselfis dense without the help of scalar multiples. Supercyclic operatorsare, in turn, a special case of cyclic operators. An operatoris called cyclic if the linear span of the orbit of some vectoris dense in the underlying space. This survey describes somerecent results on linear subspaces in which all elements, exceptthe zero vector, are supercyclic for a given supercyclic operator.2000 Mathematics Subject Classification 47A16.     

Asymptotic Solution of Hyperbolic Systems with Constant Coefficients

An integral representation of the exact solution of the initialvalue problem for the hyperbolic equation of the form is derived. Here A^o, A^v, B, and Care constant m x m matrices, u(t, X; ) is an m-component columnvector, and is a positive parameter. Various conditions areimposed on the coefficient matrices that permit the applicationof the method of stationary phase in several variables to theintegral representation of the exact solution. The leading termof the asymptotic expansion as of the exact solution is obtainedfor several types of initial data and source functions whichdepend on the parameter .