On the Discreteness and Convergence in n-Dimensional Mobius Groups

Throughout this paper, we adopt the same notations as in [1,6, 8] such as the Möbius group M(Rⁿ), the Clifford algebraC_n–1, the Clifford matrix group SL(2, _n), the Cliffordnorm of ||A||=(|a|²+|b|²+|c|²+|d|²) (1) and the Clifford metric of SL(2, _n) or of the Möbius groupM(Rⁿ) d(A₁,A₂)=||A₁–A₂||(|a₁–a₂|²+|b₁–b₂|²+|c₁–c₂|²+|d₁–d₂|²)(2) where |·| is the norm of a Clifford number and represents f_i M(), i = 1,2, and so on. In addition, we adopt some notions in [6, 12]:the elementary group, the uniformly bounded torsion, and soon. For example, the definition of the uniformly bounded torsionis as follows.     

Bounds For Gradient Trajectories and Geodesic Diameter of Real Algebraic Sets

Let M Rⁿ be a connected component of an algebraic set ^–1(0),where is a polynomial of degree d. Assume that M is containedin a ball of radius r. We prove that the geodesic diameter ofM is bounded by 2rv(n)d(4d–5)^n–2, where v(n) =(1/2)((n+1)/2)(n/2)^–1.This estimate is based on the bound rv(n)d(4d–5)^n–2for the length of the gradient trajectories of a linear projectionrestricted to M. 2000 Mathematics Subject Classification 32Bxx,34Cxx (primary), 32Sxx, 14P10 (secondary).     

On the Asymptotics of the Growth of 2-Step Nilpotent Groups

Pansu has shown that the growth function of every virtuallynilpotent group with respect to any finite generating set hasasymptotics (n)n^d, where d is the degree of growth of . Thepaper refines his result in the special case of 2-step nilpotentgroups to obtain (n)=n^d+O(n^d–1).     

Relation Modules of Infinite Groups

Let F_n be the free group of rank n with basis x₁, x₂, ..., x_n,and let d(G) denote the minimal number of generators of thefinitely generated group G. Suppose that n d(G). There existsan exact sequence and wemay view the free abelian group as a right ZG-module by defining (rR')^g = r^g–1R' for allg G, where g^–1 is any preimage of g under , and = (g^–1)^–1 r(g^–1),the conjugate of r by g^–1. We call the relation module of G associated with the presentation(1), and say that has ambient rank n. Furthermore, we call the group F_n/R' the free abelianizedextension of G associated with (1). 1991 Mathematics SubjectClassification 20F05, 20C07.     

A Note on Groups Associated with 4-Arc-Transitive Cubic Graphs

A cubic (trivalent) graph is said to be 4-arc-transitive ifits automorphism group acts transitively on the 4-arcs of (wherea 4-arc is a sequence v₀, v₁, ... v₄ of vertices of such thatv_i–1 is adjacent to v_i for 1 i 4, and v_i–1 v_i+1for 1 i < 4). In his investigations into graphs of thissort, Biggs defined a family of groups 4⁺(a^m), for m = 3,4,5...,each presented in terms of generators and relations under theadditional assumption that the vertices of a circuit of lengthm are cyclically permuted by some automorphism. In this paperit is shown that whenever m is a proper multiple of 6, the group4⁺(a^m) is infinite. The proof is obtained by constructing transitivepermutation representations of arbitrarily large degree.     

Bifurcations of Periodic Points of Holomorphic Maps From C2 into C2

Let F:Cⁿ Cⁿ be a holomorphic map, F^k be the kth iterate ofF, and p Cⁿ be a periodic point of F of period k. That is,F^k(p) = p, but for any positive integer j with j < k, F^j(p) p. If p is hyperbolic, namely if DF^k(p) has no eigenvalue ofmodulus 1, then it is well known that the dynamical behaviourof F is stable near the periodic orbit = {p, F(p),..., F^k–1(p)}.But if is not hyperbolic, the dynamical behaviour of F near may be very complicated and unstable. In this case, a veryinteresting bifurcational phenomenon may occur even though may be the only periodic orbit in some neighbourhood of : forgiven M N\{1}, there may exist a C^r-arc {F_t: t [0,1]} (wherer N or r = ) in the space H(Cⁿ) of holomorphic maps from Cⁿinto Cⁿ, such that F₀ = F and, for t (0,1], F_t has an Mk-periodicorbit _t with as t 0. Theperiod thus increases by a factor M under a C^r-small perturbation!If such an F_t does exist, then , as well as p, is said to beM-tupling bifurcational. This definition is independent of r. For the above F, there may exist a C^r-arc in H(Cⁿ), with t [0,1], such that and, for t (0,1], has two distinct k-periodic orbits _t,1 and _t,2 with d(_t,i, ) 0 as t 0 for i = 1,2. If such an does exist, then , as well as p, is said to be 1-tupling bifurcational. In recent decades, there have been many papers and remarkableresults which deal with period doubling bifurcations of periodicorbits of parametrized maps. L. Block and D. Hart pointed outthat period M-tupling bifurcations cannot occur for M >2 in the 1-dimensional case. There are examples showing thatfor any M N, period M-tupling bifurcations can occur in higher-dimensionalcases. An M-tupling bifurcational periodic orbit as defined here actsas a critical orbit which leads to period M-tupling bifurcationsin some parametrized maps. The main result of this paper isthe following. Theorem. Let k N and M N, and let F: C² C² be a holomorphicmap with k-periodic point p. Then p is M-tupling bifurcationalif and only if DF^k(p) has a non-zero periodic point of periodM. 1991 Mathematics Subject Classification: 32H50, 58F14.     

A Strong Law for the Largest Nearest-Neighbour Link between Random Points

Suppose that X₁, X₂, X₃, ... are independent random points inR^d with common density f, having compact support with smoothboundary , with f| continuous. Let Rⁿ_{i, k} denote the distancefrom X_i to its kth nearest neighbour amongst the first n points,and let M_{n, k} = max_in Rⁿ_{i, k}. Let denote the volume of theunit ball. Then as n , , almost surely If instead the points lie in a compact smooth d-dimensionalRiemannian manifold K, then nM^d_{n, k}/log n (min_Kf)^–1,almost surely.     

Total Flux Estimates for a Finite-Element Approximation of Elliptic Equations

An elliptic boundary-value problem on a domain with prescribedDirichlet data on _I is approximated using a finite-elementspace of approximation power h^K in the L² norm. It is shownthat the total flux across _I can be approximated with an errorof O(h^K) when is a curved domain in Rⁿ (n = 2 or 3) and isoparametricelements are used. When is a polyhedron, an O(h^2K–2)approximation is given. We use these results to study the finite-elementapproximation of elliptic equations when the prescribed boundarydata on _I is the total flux. Present address: School of Mathematical and Physical Sciences,University of Sussex, Brighton, Sussex BN1 9QH.     

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.     

Shapiro's Cyclic Sum

Shapiro's cyclic sum is defined by , If K is the cone in Rⁿ of points withnon-negative coordinates, it is shown that the minimum of Ein K is a fixed point of T², where T is the non-linear operatordefined by (Tx)_i = x_n–i+1/(x_n–i+2 + x_n–i+3)²for i = 1,2,...,n. It is conjectured that Tx = S^kx, where Sis the shift operator in Rⁿ, and a proof is given under someadditional hypotheses. One of the consequences is a simple proofthat at the minimum point, a_i(x) = a_n–i+1–k(x) fori = 1,2,...,n.     

Homomorphisms from Automorphism Groups of Free Groups

The automorphism group of a finitely generated free group isthe normal closure of a single element of order 2. If m <n, then a homomorphism Aut(F_n)Aut(F_m) can have image of cardinalityat most 2. More generally, this is true of homomorphisms fromAut(F_n) to any group that does not contain an isomorphic imageof the symmetric group S_n+1. Strong restrictions are also obtainedon maps to groups that do not contain a copy of W_n = (Z/2)ⁿ S_n, or of Z^n–1. These results place constraints on howAut(F_n) can act. For example, if n 3, any action of Aut(F_n)on the circle (by homeomorphisms) factors through det : Aut(F_n)Z₂.2000 Mathematics Subject Classification 20F65, 20F28 (primary).     

The Asymptotic Behaviour of the Coefficients in Stokes's Series for Surface Gravity Waves

It is shown that the asymptotic behaviour of the coefficientsa_n at high order n and at large wave steepness ak is determinedmainly by the limiting form of the wave crest. In a lower rangeof n, a_n, decreases like n^–, corresponding to the Stokes120° corner flow. In an upper range, a_n, decreases exponentiallywith n. The transition occurs when n³ is O(1) where is relatedto the steepness ak of the waves by ² = 2.0[(ak)_max –ak].     

Long Snakes in Powers of the Complete Graph with an Odd Number of Vertices

In [5] Abbott and Katchalski ask if there exists a constantc < 0 such that for every d 2 there is a snake (cycle withoutchords) of length at least c3^d in the product of d copies ofthe complete graph K₃. We show that the answer to the abovequestion is positive, and that in general for any odd integern there is a constant c_n such that for every d 2 there is asnake of length at least c_n n^d in the product of d copies ofthe complete graph K_n.     

On the laplace equation with non-linear dynamical boundary conditions

The main part of the paper deals with local existence and globalexistence versus blow-up for solutions of the Laplace equationin bounded domains with a non-linear dynamical boundary condition.More precisely, we study the problem consisting in: (1) theLaplace equation in (0, ) x ; (2) a homogeneous Dirichlet condition(0, ) x ₀; (3) the dynamical boundary condition ; (4) the initial condition u(0, x) = u₀ (x) on . Here is a regular and bounded domain in Rⁿ, with n 1, and₀ and ₁ endow a measurable partition of . Moreover, m>1,2 p < r, where r = 2 (n – 1) / (n – 2) whenn 3, r = when n = 1,2, and u₀ H^1/2 , u₀ = 0 on ₀. The final part of the paper deals with a refinement of a globalnon-existence result by Levine, Park and Serrin, which is appliedto the previous problem. 2000 Mathematics Subject Classification35K55 (primary), 35K90, 35K77 (secondary).     

Correction: the Embedding of Radical Rings in Simple Radical Rings

As G. M. Bergman has pointed out, in the proof of the lemmaon p. 187, we cannot conclude that $$\stackrel{\&macr;}{S}$$is universal in the sense stated. However, the proof can becompleted as follows: Any element of $$\stackrel{\&macr;}{S}$$can be obtained as the first component of the solution u ofa system (A–I)u+a = 0, (1) where A S_n, a ⁿS and A–I has an inverse over L. SinceS is generated by R and k{s}, A can (by the last part of Lemma3.2 of [1]) be taken to be linear in these arguments, say A= A₀ + sA1, where A₀ R_n, A₀ R_n, A₁ K_n. Multiplying by (I–sA₁)^–1,we reduce this equation to the form (S_vB_v–I)u+a=0, (2) with the same solution u as before, where B_v R_n, s_v k{s}¹and a ⁿS. Now consider the retraction S k{s} (3) obtained by mapping R 0. If we denote its effect by x x^*,then (2) goes over into an equation –I.v + a^* 0, (4) which clearly has a unique solution v in k{s}; therefore theretraction (3) can be extended to a homomorphism $$\stackrel{\&macr;}{S}$$ k{s}, again denoted by x x^*, provided we can show that u₁^*does not depend on the equation (1) used to define it. Thisamounts to showing that if an equation (1), or equivalently(2), has the solution u₁ = 0, then after retraction we get v₁= 0 in (4), i.e. a₁^* = 0. We shall use induction on n; if u₁= 0 in (2), then by leaving out the first row and column ofthe matrix on the left of (2), we have an equation for u₂,...,u_n and by the induction hypothesis, their values after retractionare uniquely determined. Now from (2) we have where B = (b_ij^v). Applying ^* and observing that b_ij^vR, we seethat a₁ ^* = 0, as we wished to show. The proof still appliesfor n = 1, so we have a well-defined mapping $$\stackrel{\&macr;}{S}$$ k{s}, which is a homomorphism. Now the proof of the lemma canbe completed as before.     

An error bound for the modified successive overrelaxation method

In this paper we consider the modified successive overrelaxation(MSOR)methodto appropriate the solution of the linear system D^-1/2 Ax =D^-1/2b, where A is a symmetric, positive definite and consistentlyordered matrix and D is a diagonal matrix with the diagonalidentical to that of A. The main purpose of this paper is to obtain some theoreticalresults, namely a bound for the norm of _n = v –v_n in termsof the norms _n –v_n-1, _n+1 –v_n and their inner product,where v =D^-1/2 x and v_n is the nth iteration vector, obtainedusing the (MSOR)method.     

The Approximation Numbers of Hardy-Type Operators on Trees

The Hardy operator T_a on a tree is defined by Properties of T_a as a map from L^p() into itselfare established for 1 p . The main result is that, with appropriateassumptions on u and v, the approximation numbers a_n(T_a) ofT_a satisfy for a specified constant _p and 1 p < . This extends results of Naimark, Newmanand Solomyak for p = 2. Hitherto, for p 2, (*) was unknowneven when is an interval. Also, upper and lower estimates forthe l^q and weak-l^q norms of a_n(T_a) are determined. 2000 MathematicalSubject Classification: 47G10, 47B10.     

On the Greatest Prime Divisor of the Sum of Two Squares of Primes

One of the most famous theorems in number theory states thatthere are infinitely many positive prime numbers (namely p =2 and the primes p 1 mod4) that can be represented in the formx²₁+x²₂, where x₁ and x₂ are positive integers. In a recentpaper, Fouvry and Iwaniec [2] have shown that this statementremains valid even if one of the variables, say x₂, is restrictedto prime values only. In the sequel, the letter p, possiblywith an index, is reserved to denote a positive prime number.As p²₁=p²₂ = p is even for p₁, p₂ > 2, it is reasonable toconjecture that the equation p²₁=p²₂ = 2p has an infinity ofsolutions. However, a proof of this statement currently seemsfar beyond reach. As an intermediate step in this direction,one may quantify the problem by asking what can be said aboutlower bounds for the greatest prime divisor, say P(N), of thenumbers p²₁=p²₂, where p₁, p₂ N, as a function of the realparameter N 1. The well-known Chebychev–Hooley methodcombined with the Barban–Davenport–Halberstam theoremalmost immediately leads to the bound P(N) N^1–, if N N_o(); here, denotes some arbitrarily small fixed positivereal number. The first estimate going beyond the exponent 1has been achieved recently by Dartyge [1, Théorème1], who showed that P(N) N^10/9–. Note that Dartyge'sproof provides the more general result that for any irreduciblebinary form f of degree d 2 with integer coefficients the greatestprime divisor of the numbers |f(p₁, p₂)|, p₁, p₂ N, exceedsN^_d–, where _d = 2 – 8/(d = 7). We in particular wantto point out that Dartyge does not make use of the specificfeatures provided by the form x²₁+x²₂. By taking advantage ofsome special properties of this binary form, we are able toimprove upon the exponent ₂ = 10/9 considerably.     

Spaces of Harmonic Functions

It is important and interesting to study harmonic functionson a Riemannian manifold. In an earlier work of Li and Tam [21]it was demonstrated that the dimensions of various spaces ofbounded and positive harmonic functions are closely relatedto the number of ends of a manifold. For the linear space consistingof all harmonic functions of polynomial growth of degree atmost d on a complete Riemannian manifold Mⁿ of dimension n,denoted by H_d(Mⁿ), it was proved by Li and Tam [20] that thedimension of the space H₁(M) always satisfies dimH₁(M) dimH₁(Rⁿ)when M has non-negative Ricci curvature. They went on to askas a refinement of a conjecture of Yau [32] whether in generaldim H_d(Mⁿ) dimH_d(Rⁿ)for all d. Colding and Minicozzi made animportant contribution to this question in a sequence of papers[5–11] by showing among other things that dimH_d(M) isfinite when M has non-negative Ricci curvature. On the otherhand, in a very remarkable paper [16], Li produced an elegantand powerful argument to prove the following. Recall that Msatisfies a weak volume growth condition if, for some constantA and , (1.1) for all x M and r R, where V_x(r) is the volume of the geodesicball B_x(r) in M; M has mean value property if there exists aconstant B such that, for any non-negative subharmonic functionf on M, (1.2) for all p M and r > 0.     

Finite-Element Approximation of a Plasma Equilibrium Problem

The plasma problem studied is: given R⁺ find (, d, u) R ?R ? H¹() such that Let ₁ < ₂ be the first two eigenvalues of the associatedlinear eigenvalue problem: find $$\left(\lambda ,\phi \right)\in\mathrm{R;}\times {\hbox{ H }}_{0}^{1}\left(\Omega \right)$$such that For ₀(0,₂) it is well known that there exists a unique solution(₀, d₀, u₀) to the above problem. We show that the standard continuous piecewise linear Galerkinfinite-element approximatinon $$\left({\lambda }_{0},{\hbox{d }}_{0}^{k},{u}_{0}^{h}\right)$$, for ₀(0,₂), converges atthe optimal rate in the H¹, L², and L norms as h, the mesh length,tends to 0. In addition, we show that dist (, ^h)Ch² ln 1/h,where $${\Gamma }^{\left(h\right)}=\left\{x\in \Omega :{u}_{0}^{\left(h\right)}\left(x\right)=0\right\}$$.Finally we consider a more practical approximation involvingnumerical integration.