首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
We prove that if GG is a finite simple group which is the unit group of a ring, then GG is isomorphic to: (a) a cyclic group of order 2; or (b) a cyclic group of prime order 2k−12k1 for some kk; or (c) a projective special linear group PSLn(F2)PSLn(F2) for some n≥3n3. Moreover, these groups do all occur as unit groups. We deduce this classification from a more general result, which holds for groups GG with no non-trivial normal 2-subgroup.  相似文献   

5.
We study a family of differential operators LαLα in two variables, depending on the coupling parameter α?0α?0 that appears only in the boundary conditions. Our main concern is the spectral properties of LαLα, which turn out to be quite different for α<1α<1 and for α>1α>1. In particular, LαLα has a unique self-adjoint realization for α<1α<1 and many such realizations for α>1α>1. In the more difficult case α>1α>1 an analysis of non-elliptic pseudodifferential operators in dimension one is involved.  相似文献   

6.
A structure is associated with the quantum harmonic oscillator, over a fixed algebraically closed field FF of characteristic 0, which is shown to be uncountably categorical. An analysis of definable sets is carried out, from which it follows that this structure is a Zariski geometry of dimension 1. It is non-classical in the sense that it is not interpretable in ACF0ACF0 and in the case F=CF=C, is not a structure on a complex manifold.  相似文献   

7.
8.
9.
10.
This paper is concerned with the Cauchy problem for the fast diffusion equation ut−Δum=αup1utΔum=αup1 in RNRN (N≥1N1), where m∈(0,1)m(0,1), p1>1p1>1 and α>0α>0. The initial condition u0u0 is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value u0u0 so that u(t,x)u(t,x) blows up in finite time, and we show how to get estimates on the profile of u(t,x)u(t,x) for small enough values of t>0t>0.  相似文献   

11.
Bosek and Krawczyk exhibited an on-line algorithm for partitioning an on-line poset of width ww into w14lgww14lgw chains. They also observed that the problem of on-line chain partitioning of general posets of width ww could be reduced to First-Fit chain partitioning of 2w2+12w2+1-ladder-free posets of width ww, where an mm-ladder is the transitive closure of the union of two incomparable chains x1≤?≤xmx1?xm, y1≤?≤ymy1?ym and the set of comparabilities {x1y1,…,xmym}{x1y1,,xmym}. Here, we provide a subexponential upper bound (in terms of ww with mm fixed) for the performance of First-Fit chain partitioning on mm-ladder-free posets, as well as an exact quadratic bound when m=2m=2, and an upper bound linear in mm when w=2w=2. Using the Bosek–Krawczyk observation, this yields an on-line chain partitioning algorithm with a somewhat improved performance bound. More importantly, the algorithm and the proof of its performance bound are much simpler.  相似文献   

12.
We show that the equality m1(f(x))=m2(g(x))m1(f(x))=m2(g(x)) for xx in a neighborhood of a point aa remains valid for all xx provided that ff and gg are open holomorphic maps, f(a)=g(a)=0f(a)=g(a)=0 and m1,m2m1,m2 are Minkowski functionals of bounded balanced domains. Moreover, a polynomial relation between ff and gg is obtained.  相似文献   

13.
Let FF be an infinite field with characteristic not equal to two. For a graph G=(V,E)G=(V,E) with V={1,…,n}V={1,,n}, let S(G;F)S(G;F) be the set of all symmetric n×nn×n matrices A=[ai,j]A=[ai,j] over FF with ai,j≠0ai,j0, i≠jij if and only if ij∈EijE. We show that if G is the complement of a partial k  -tree and m?k+2m?k+2, then for all nonsingular symmetric m×mm×m matrices K   over FF, there exists an m×nm×n matrix U   such that UTKU∈S(G;F)UTKUS(G;F). As a corollary we obtain that, if k+2?m?nk+2?m?n and G is the complement of a partial k-tree, then for any two nonnegative integers p and q   with p+q=mp+q=m, there exists a matrix in S(G;R)S(G;R) with p positive and q negative eigenvalues.  相似文献   

14.
15.
16.
Given n   independent standard normal random variables, it is well known that their maxima MnMn can be normalized such that their distribution converges to the Gumbel law. In a remarkable study, Hall proved that the Kolmogorov distance dndn between the normalized MnMn and its associated limit distribution is less than 3/log?n3/log?n. In the present study, we propose a different set of norming constants that allow this upper bound to be decreased with dn≤C(m)/log?ndnC(m)/log?n for n≥m≥5nm5. Furthermore, the function C(m)C(m) is computed explicitly, which satisfies C(m)≤1C(m)1 and limm?C(m)=1/3limm?C(m)=1/3. As a consequence, some new and effective norming constants are provided using the asymptotic expansion of a Lambert W type function.  相似文献   

17.
The oscillation of solutions of f+Af=0f+Af=0 is discussed by focusing on four separate situations. In the complex case AA is assumed to be either analytic in the unit disc DD or entire, while in the real case AA is continuous either on (−1,1)(1,1) or on (0,∞)(0,). In all situations AA is expected to grow beyond bounds that ensure finite oscillation for all (non-trivial) solutions, and the separation between distinct zeros of solutions is considered.  相似文献   

18.
19.
20.
We consider a multidimensional diffusion XX with drift coefficient b(α,Xt)b(α,Xt) and diffusion coefficient ?σ(β,Xt)?σ(β,Xt). The diffusion sample path is discretely observed at times tk=kΔtk=kΔ for k=1…nk=1n on a fixed interval [0,T][0,T]. We study minimum contrast estimators derived from the Gaussian process approximating XX for small ??. We obtain consistent and asymptotically normal estimators of αα for fixed ΔΔ and ?→0?0 and of (α,β)(α,β) for Δ→0Δ0 and ?→0?0 without any condition linking ?? and ΔΔ. We compare the estimators obtained with various methods and for various magnitudes of ΔΔ and ?? based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework.  相似文献   

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

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