首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Shapiro's cyclic sum is defined by , If K is the cone in Rn of points withnon-negative coordinates, it is shown that the minimum of Ein K is a fixed point of T2, where T is the non-linear operatordefined by (Tx)i = xni+1/(xni+2 + xni+3)2for i = 1,2,...,n. It is conjectured that Tx = Skx, where Sis the shift operator in Rn, and a proof is given under someadditional hypotheses. One of the consequences is a simple proofthat at the minimum point, ai(x) = ani+1–k(x) fori = 1,2,...,n.  相似文献   

2.
On the Discreteness and Convergence in n-Dimensional Mobius Groups   总被引:5,自引:0,他引:5  
Throughout this paper, we adopt the same notations as in [1,6, 8] such as the Möbius group M(Rn), the Clifford algebraCn–1, the Clifford matrix group SL(2, n), the Cliffordnorm of ||A||=(|a|2+|b|2+|c|2+|d|2) (1) and the Clifford metric of SL(2, n) or of the Möbius groupM(Rn) d(A1,A2)=||A1A2||(|a1a2|2+|b1b2|2+|c1c2|2+|d1d2|2)(2) where |·| is the norm of a Clifford number and represents fi 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.  相似文献   

3.
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 –vn in termsof the norms nvn-1, n+1 –vn and their inner product,where v =D-1/2 x and vn is the nth iteration vector, obtainedusing the (MSOR)method.  相似文献   

4.
Hemisystems on the Hermitian Surface   总被引:2,自引:0,他引:2  
The natural geometric setting of quadrics commuting with a Hermitiansurface of PG(3,q2), q odd, is adopted and a hemisystem on theHermitian surface H(3,q2) admitting the group P(4,q)is constructed, yielding a partial quadrangle PQ((q–1)/2,q2,(q–1)2/2) and a strongly regular graph srg((q3+1)(q+1)/2,(q2+1)(q–1)/2,(q–3)/2,(q–1)2/2).For q>3, no partial quadrangle or strongly regular graphwith these parameters was previously known, whereas when q=3,this is the Gewirtz graph. Thas conjectured that there are nohemisystems on H(3,q2) for q>3, so these are counterexamplesto his conjecture. Furthermore, a hemisystem on H(3,25) admitting3.A7.2 is constructed. Finally, special sets (after Shult) andovoids on H(3,q2) are investigated.  相似文献   

5.
Hypersurfaces in a Unit Sphere Sn+1(1) with Constant Scalar Curvature   总被引:3,自引:0,他引:3  
The paper considers n-dimensional hypersurfaces with constantscalar curvature of a unit sphere Sn–1(1). The hypersurfaceSk(c1)xSnk(c2) in a unit sphere Sn+1(1) is characterized,and it is shown that there exist many compact hypersurfaceswith constant scalar curvature in a unit sphere Sn+1(1) whichare not congruent to each other in it. In particular, it isproved that if M is an n-dimensional (n > 3) complete locallyconformally flat hypersurface with constant scalar curvaturen(n–1)r in a unit sphere Sn+1(1), then r > 1–2/n,and (1) when r (n–2)/(n–1), if then M is isometric to S1xSn–1(c),where S is the squared norm of the second fundamental form ofM; (2) there are no complete hypersurfaces in Sn+1(1) with constantscalar curvature n(n–1)r and with two distinct principalcurvatures, one of which is simple, such that r = (n–2)/(n–1)and   相似文献   

6.
This paper is devoted to the long-time behavior of solutionsto the Cauchy problem of the porous medium equation ut = (um)– up in Rn x (0,) with (1 – 2/n)+ < m < 1and the critical exponent p = m + 2/n. For the strictly positiveinitial data u(x,0) = O(1 + |x|)–k with n + mn(2 –n + nm)/(2[2 – m + mn(1 – m)]) k < 2/(1 –m), we prove that the solution of the above Cauchy problem convergesto a fundamental solution of ut = (um) with an additional logarithmicanomalous decay exponent in time as t .  相似文献   

7.
Let µ be a real number. The Möbius group Gµis the matrix group generated by It is known that Gµ is free if |µ| 2 (see [1])or if µ is transcendental (see [3, 8]). Moreover, thereis a set of irrational algebraic numbers µ which is densein (–2, 2) and for which Gµ is non-free [2, p. 528].We may assume that µ > 0, and in this paper we considerrational µ in (0, 2). The following problem is difficult. Let Gnf denote the set of all rational numbers µ in (0,2) for which Gµ is non-free. In 1969 Lyndon and Ullman[8] proved that Gnf contains the elements of the forms p/(p2+ 1) and 1/(p + 1), where p = 1, 2, ..., and that if µ0 Gnf, then µ0/p Gnf for p = 1, 2, .... In 1993 Beardon[2] studied problem (P) by means of the words of the form ArBs At and Ar Bs At Bu Av, and he obtained a sufficient conditionfor solvability of (P), included implicitly in [2, pp. 530–531],by means of the following Diophantine equations: 1991 Mathematics SubjectClassification 20E05, 20H20, 11D09.  相似文献   

8.
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 Sn, a nS 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= A0 + sA1, where A0 Rn, A0 Rn, A1 Kn. Multiplying by (I–sA1)–1,we reduce this equation to the form (SvBv–I)u+a=0, (2) with the same solution u as before, where Bv Rn, sv k{s}1and a nS. 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 u1*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 u1 = 0, then after retraction we get v1= 0 in (4), i.e. a1* = 0. We shall use induction on n; if u1= 0 in (2), then by leaving out the first row and column ofthe matrix on the left of (2), we have an equation for u2,...,un and by the induction hypothesis, their values after retractionare uniquely determined. Now from (2) we have where B = (bijv). Applying * and observing that bijvR, we seethat a1 * = 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.  相似文献   

9.
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 formx21+x22, where x1 and x2 are positive integers. In a recentpaper, Fouvry and Iwaniec [2] have shown that this statementremains valid even if one of the variables, say x2, is restrictedto prime values only. In the sequel, the letter p, possiblywith an index, is reserved to denote a positive prime number.As p21=p22 = p is even for p1, p2 > 2, it is reasonable toconjecture that the equation p21=p22 = 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 p21=p22, where p1, p2 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) N1–, if N No(); 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) N10/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(p1, p2)|, p1, p2 N, exceedsNd, 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 x21+x22. By taking advantage ofsome special properties of this binary form, we are able toimprove upon the exponent 2 = 10/9 considerably.  相似文献   

10.
Let C be a genus 2 algebraic curve defined by an equation ofthe form y2 = x(x2 – 1)(xa)(x – 1/a). Asis well known, the five accessory parameters for such an equationcan all be expressed in terms of a and the accessory parameter b corresponding to a. The main result of the paper is thatif a' = 1 – a2, which in general yields a non-isomorphiccurve C', then b'a'(a'2 – 1) = – – ba(a2– 1). This is proven by it being shown how the uniformizing functionfrom the unit disk to C' can be explicitly described in termsof the uniformizing function for C.  相似文献   

11.
Consider the following infinite dimensional stochastic evolutionequation over some Hilbert space H with norm |·|: It is proved that under certain mild assumptions, the strongsolution Xt(x0)VHV*, t 0, is mean square exponentially stableif and only if there exists a Lyapunov functional (·,·):HxR+R1 which satisfies the following conditions: (i)c1|x|2k1e–µ1t(x,t)c2|x|2+k2+k2e–µ2t; (ii) L(x,t)–c3(x,t)+k3e–µ3t, xV, t0; where L is the infinitesimal generator of the Markov processXt and ci, ki, µi, i = 1, 2, 3, are positive constants.As a by-product, the characterization of exponential ultimateboundedness of the strong solution is established as the nulldecay rates (that is, µi = 0) are considered.  相似文献   

12.
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 v0, v1, ... v4 of vertices of such thatvi–1 is adjacent to vi for 1 i 4, and vi–1 vi+1for 1 i < 4). In his investigations into graphs of thissort, Biggs defined a family of groups 4+(am), 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+(am) is infinite. The proof is obtained by constructing transitivepermutation representations of arbitrarily large degree.  相似文献   

13.
Let F = (F1, ..., Fm) be an m-tuple of primitive positive binaryquadratic forms and let UF(x) be the number of integers notexceeding x that can be represented simultaneously by all theforms Fj, j = 1, ... , m. Sharp upper and lower bounds for UF(x)are given uniformly in the discriminants of the quadratic forms. As an application, a problem of Erds is considered. Let V(x)be the number of integers not exceeding x that are representableas a sum of two squareful numbers. Then V(x) = x(log x)–+o(1)with = 1 – 2–1/3 = 0.206....  相似文献   

14.
In several physical contexts the equations for the dispersionof a buoyant contaminant can be approximated by the Erdogan-Chatwin(1967) equation {dot}c = {dot}y{[Do + ({dot}yc)2D2]{dot}yc}. Here it is shown that in the limit of strong non-linearity (i.e.Do = 0) there are similarity solutions for a concentration jumpand for a finite discharge. A stability analysis for the latterproblem involves a new family of orthogonal polynomials Yn(z)where (1 – z4)Y – 6z3Y + n(n + 5)z2 Yn = 0 and the degree n is restricted to the values 0, 1, 4, 5, 8,9,.... A numerical solution of the Erdogan-Chatwin equationis given which describes the transition between the non-linearand linear (Gaussian) similarity solutions.  相似文献   

15.
IN SECTION 3 of the above we omitted to mention aperiodicity.The period p of the pseudo renewal sequence {an: n > 0} isgiven by p = g.c.d. {n > 1: an > 0}. We are only concernedwith aperiodic renewal sequences (i.e. where p = 1). As it standsTheorem 3.1 is incorrect and should be restated as: THEOREM 3.1 If a = (an: n = 0,1,...) is an aperiodic pseudo-renewalsequence its limit a satisfies gna–n > 1 where a–1 is to be interpreted as; if a = 0.  相似文献   

16.
On the Optimum Criterion of Polynomial Stability   总被引:1,自引:0,他引:1  
The purpose of this note is to answer the question raised byNie & Xie (1987). Let f(x)=a0xn+a1xn–1+...+an be apositive-coefficient polynomial. The numbers 1=ai-1ai+2/aiai+1(i=1, ..., n–2) are called determining coefficients. Theoptimum criterion problem was posed as follows: for n3, findthe maximal number (n) such that the polynomial f(x) is stableif i < (n) (1in–2). For n6, we show that (n)=ß,where ß is the unique real root of the equation x(x+1)2=1.  相似文献   

17.
Let A = (aij) be a Borel mapping on [0, 1] x Rd with valuesin the space of non-negative operators on Rd and let b = (bi)be a Borel mapping on [0, 1] x Rd with values in Rd. Let Under broad assumptions on A and b, we construct a family µ= (µt)t [0, 1] of probability measures µt on Rdwhich solvesthe Cauchy problem L* µ = 0 with initial conditionµ0 = , where \nu is a probability measure on Rd, in thefollowing weak sense: and Such an equation is satisfied by transition probabilities ofa diffusion process associated with A and b provided such aprocess exists. However, we do not assume the existence of aprocess and allow quite singular coefficients, in particular,b may be locally unbounded or A may be degenerate. An infinite-dimensionalanalogue is discussed as well. Main methods are Lp-analysiswith respect to suitably chosen measures and reduction to theelliptic case (studied previously) by piecewise constant approximationsin time. 2000 Mathematics Subject Classification 35K10, 35K12,60J35, 60J60, 47D07.  相似文献   

18.
Let Lkvk = gk be a system of difference equations discretizingan elliptic boundary value problem. Assume the system to be"very large", that means that the number of unknowns exceedsthe capacity of storage. We present a method for solving theproblem with much less storage requirement. For two-dimensionalproblems the size of the needed storage decreases from O(h–2)to (or even O(h–5/4)). The computational work increasesonly by a factor about six. The technique can be generalizedto nonlinear problems. The algorithm is also useful for computerswith a small number of parallel processors.  相似文献   

19.
Iterative methods for the solution of some nonlinear ellipticdifference systems, approximating the first boundary value problemare considered. If h > 0 is the network step in the spaceof variables x = (x1, x2,..., xp) and 2m is the order of theoriginal boundary value problem, then the iterative methodsproposed give solution of accuracy with the expenditure ofO(|In | h–(p+m–)) and O(|In | |In h| hp)arithmetic operations in the case of a general region and arectangular parallelepiped respectively. In the case p = 2 theestimate O(|In | h–[2+ (m/2)]) is obtained if the regionis made up of rectangles with sides parallel to the co-ordinateaxes.  相似文献   

20.
A Class of Infinite Dimensional Simple Lie Algebras   总被引:1,自引:0,他引:1  
Let A be an abelian group, F be a field of characteristic 0,and , ß be linearly independent additive maps fromA to F, and let ker()\{0}. Then there is a Lie algebra L = L(A,, ß, ) = xA Fex under the product [ex, ey]]=(xy)ex+y+(ß) (x, y) ex+y. If, further, ß() = 1, and ß(A) = Z, thereis a subalgebra L+:=L(A+, , ß, ) = xA+ Fex, whereA+ = {xA|ß(x)0}. The necessary and sufficient conditionsare given for L' = [L, L] and L+ to be simple, and all semi-simpleelements in L' and L+ are determined. It is shown that L' andL+ cannot be isomorphic to any other known Lie algebras andL' is not isomorphic to any L+, and all isomorphisms betweentwo L' and all isomorphisms between two L+ are explicitly described.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号