首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
5.
A. Mimouni 《Journal of Algebra》2009,321(5):1497-1509
In this paper, we will present new developments in the study of the links between the cardinality of the sets O(R) of all overrings of R, SSFc(R) of all semistar operations of finite character when finite to the Krull dimension of an integral domain R. In particular, we prove that if |SSFc(R)|=n+dimR, then R has at most n?1 distinct maximal ideals. Moreover, R has exactly n?1 maximal ideals if and only if n=3. In this case R is a Prüfer domain with exactly two maximal ideals and Y-graph spectrum. We also give a complete characterizations for local domains R such that |SSFc(R)|=3+dimR, and nonlocal domains R with |SSFc(R)|=|O(R)|=n+dimR for n=4, n=5, n=6 and n=7. Examples to illustrate the scopes and limits of the results are constructed.  相似文献   

6.
7.
Let G(x) be a C0 function such that |G(x)|K|x|p for |x|c, for constants K,c>0. We consider spherically symmetric solutions of gϕ=G(ϕ) where g is a Schwarzschild or more generally a Reissner–Nordström metric, and such that ϕ and ∇ϕ are compactly supported on a complete Cauchy surface. It is proven that for p>4, such solutions do not blow up in the domain of outer communications, provided the initial data are small. Moreover, |ϕ|C(max{v,1})−1, where v denotes an Eddington–Finkelstein advanced time coordinate.  相似文献   

8.
9.
10.
11.
12.
13.
Let R, S and T be finite sets with |R|=r, |S|=s and |T|=t. A code CR×S×T with covering radius 1 and minimum distance 2 is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal cardinality K(r,s,t;2). These bounds turn out to be best possible in many instances. Focussing on the special case t=s we determine K(r,s,s;2) when r divides s, when r=s1, when s is large, relative to r, when r is large, relative to s, as well as K(3r,2r,2r;2). Finally, a table with bounds on K(r,s,s;2) is given.  相似文献   

14.
15.
16.
17.
18.
19.
20.
Let p>3 be a prime. For each maximal subgroup H?GL(d,p) with |H|?p3d+1, we construct a d-generator finite p-group G with the property that Aut(G) induces H on the Frattini quotient G/Φ(G) and |G|?pd42. A significant feature of this construction is that |G| is very small compared to |H|, shedding new light upon a celebrated result of Bryant and Kovács. The groups G that we exhibit have exponent p, and of all such groups G with the desired action of H on G/Φ(G), the construction yields groups with smallest nilpotency class, and in most cases, the smallest order.  相似文献   

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

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