首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The main results proved in this paper are:

1. For any non-zero vector space V Dover a division ring D, the ring R= End(V D) is hopfian as a ring

2. Let Rbe a reduced π-regular ring &; B(R) the boolean ring of idempotents of R. If B(R) is hopfian so is R.The converse is not true even when Ris strongly regular.

3. Let Xbe a completely regular spaceC(X) (resp. C ?(X)) the ring of real valued (resp. bounded real valued) continuous functions on X. Let Rbe any one of C(X) or C ?(X). Then Ris an exchange ring if &; only if Xis zero dimensional in the sense of Katetov. for any infinite compact totally disconnected space X C(X) is an exchange ring which is not von Neumann regular.

4. Let Rbe a reduced commutative exchange ring. If Ris hopfian so is the polynomial ring R[T 1,…,T n] in ncommuting indeterminates over Rwhere nis any integer ≥ 1.

5. Let Rbe a reduced exchange ring. If Ris hopfian so is the polynomial ring R[T].  相似文献   

2.
LetR be an integral domain andI a non-zero ideal ofR. The canonical mapR→R/I is called atorsion-free cover ofR/I if everyR-homomorphism from a torsion-freeR-module intoR/I can be factored throughR. The main result of this paper is thatR→R/I is a torsion-free cover if and only ifR is complete in theR-topology andI is an ideal of injective dimension 1. In this caseI is contained in the Jacobson radical ofR. And if Λ is the endomorphism ring ofI, then Λ is a quasi-local domain. IfI is a flatR-module, thenQ→Q/Λ is a torsion-free cover, whereQ is the quotient field ofR. And thenQ/Λ is an indecomposable injectiveR (and Λ) module. Special results are obtained ifR is a Noetherian domain or a Prüfer domain.  相似文献   

3.
The principal results are that if A is an integral matrix such that AAT is symplectic then A = CQ, where Q is a permutation matrix and C is symplectic; and that if A is a hermitian positive definite matrix which is symplectic, and B is the unique hermitian positive definite pth.root of A, where p is a positive integer, then B is also symplectic.  相似文献   

4.
John Clark  Rachid Tribak 《代数通讯》2013,41(11):4390-4402
An R-module M is called almost injective if M is a supplement submodule of every module which contains M. The module M is called F-almost injective if every factor module of M is almost injective. It is shown that a ring R is a right H-ring if and only if R is right perfect and every almost injective module is injective. We prove that a ring R is semisimple if and only if the R-module R R is F-almost injective.  相似文献   

5.
Let D be an integral domain such that Int(D) ≠ K[X] where K is the quotient field of D. There is no known example of such a D so that Int(D) has finite elasticity. If E is a finite nonempty subset of D, then it is known that Int(E, D) = {f(X) ∈ K[X] | f(e) ∈ D for all eE} is not atomic. In this note, we restrict the notion of elasticity so that it is applicable to nonatomic domains. For each real number r ≥ 1, we produce a ring of integer-valued polynomials with restricted elasticity r. We further show that if D is a unique factorization domain and E is finite with |E| > 1, then the restricted elasticity of Int(E, D) is infinite.  相似文献   

6.
For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated (e. g. every K-Suslin algebra is a K-partition complete Boolean algebra). It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular Ku, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K.  相似文献   

7.
On the generalized Lie structure of associative algebras   总被引:5,自引:0,他引:5  
We study the structure of Lie algebras in the category H MA ofH-comodules for a cotriangular bialgebra (H, 〈|〉) and in particular theH-Lie structure of an algebraA in H MA. We show that ifA is a sum of twoH-commutative subrings, then theH-commutator ideal ofA is nilpotent; thus ifA is also semiprime,A isH-commutative. We show an analogous result for arbitraryH-Lie algebras whenH is cocommutative. We next discuss theH-Lie ideal structure ofA. We show that ifA isH-simple andH is cocommutative, then any non-commutativeH-Lie idealU ofA must contain [A, A]. IfU is commutative andH is a group algebra, we show thatU is in the graded center ifA is a graded domain. Dedicated to the memory of S. A. Amitsur Supported by a Fulbright grant. Supported by NSF grant DMS-9203375.  相似文献   

8.
《代数通讯》2013,41(5):1945-1959
Abstract

Let R be a commutative ring. An R-module M is called a multiplication module if for each submodule N of M, N?=?IM for some ideal I of R. An R-module M is called a pm-module, i.e., M is pm, if every prime submodule of M is contained in a unique maximal submodule of M. In this paper the following results are obtained. (1) If R is pm, then any multiplication R-module M is pm. (2) If M is finitely generated, then M is a multiplication module if and only if Spec(M) is a spectral space if and only if Spec(M)?=?{PM?|?P?∈?Spec(R) and P???M }. (3) If M is a finitely generated multiplication R-module, then: (i) M is pm if and only if Max(M) is a retract of Spec(M) if and only if Spec(M) is normal if and only if M is a weakly Gelfand module; (ii) M is a Gelfand module if and only if Mod(M) is normal. (4) If M is a multiplication R-module, then Spec(M) is normal if and only if Mod(M) is weakly normal.  相似文献   

9.
Let M be a random (n×n)-matrix over GF[q] such that for each entry Mij in M and for each nonzero field element α the probability Pr[Mij=α] is p/(q−1), where p=(log nc)/n and c is an arbitrary but fixed positive constant. The probability for a matrix entry to be zero is 1−p. It is shown that the expected rank of M is n−𝒪(1). Furthermore, there is a constant A such that the probability that the rank is less than nk is less than A/qk. It is also shown that if c grows depending on n and is unbounded as n goes to infinity, then the expected difference between the rank of M and n is unbounded. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 10 , 407–419, 1997  相似文献   

10.
Let G be a graph of order n and define NC(G) = min{|N(u) ∪ N(v)| |uv ? E(G)}. A cycle C of G is called a dominating cycle or D-cycle if V(G) - V(C) is an independent set. A D-path is defined analogously. The following result is proved: if G is 2-connected and contains a D-cycle, then G contains a D-cycle of length at least min{n, 2NC(G)} unless G is the Petersen graph. By combining this result with a known sufficient condition for the existence of a D-cycle, a common generalization of Ore's Theorem and several recent “neighborhood union results” is obtained. An analogous result on long D-paths is also established.  相似文献   

11.
An R-module M is called a multiplication module if for each submodule N of M, N = IM for some ideal I of R. As defined for a commutative ring R, an R-module M is said to be reduced if the intersection of prime submodules of M is zero. The prime spectrum and minimal prime submodules of the reduced module M are studied. Essential submodules of M are characterized via a topological property. It is shown that the Goldie dimension of M is equal to the Souslin number of Spec(M)\mbox{\rm Spec}(M). Also a finitely generated module M is a Baer module if and only if Spec(M)\mbox{\rm Spec}(M) is an extremally disconnected space; if and only if it is a CS-module. It is proved that a prime submodule N is minimal in M if and only if for each x ∈ N, Ann(x) \not í (N:M).\mbox{\rm Ann}(x) \not \subseteq (N:M). When M is finitely generated; it is shown that every prime submodule of M is maximal if and only if M is a von Neumann regular module (VNM); i.e., every principal submodule of M is a summand submodule. Also if M is an injective R-module, then M is a VNM.  相似文献   

12.
A new algorithm for rearranging a heap is presented and analysed in the average case. The average case upper bound for deleting the maximum element of a random heap is improved, and is shown to be less than [logn]+0.299+M(n) comparisons, *) whereM(n) is between 0 and 1. It is also shown that a heap can be constructed using 1.650n+O(logn) comparisons with this algorithm, the best result for any algorithm which does not use any extra space. The expected time to sortn elements is argued to be less thann logn+0.670n+O(logn), while simulation result points at an average case ofn log n+0.4n which will make it the fastest in-place sorting algorithm. The same technique is used to show that the average number of comparisons when deleting the maximum element of a heap using Williams' algorithm for rearrangement is 2([logn]–1.299+L(n)) whereL(n) also is between 0 and 1, and the average cost for Floyd-Williams Heapsort is at least 2nlogn–3.27n, counting only comparisons. An analysis of the number of interchanges when deleting the maximum element of a random heap, which is the same for both algorithms, is also presented.  相似文献   

13.
Vahap Erdoğdu 《代数通讯》2013,41(5):1802-1807
We call an ideal I of a ring R radically perfect if among all ideals whose radical is equal to the radical of I, the one with the least number of generators has this number of generators equal to the height of I. Let R be a ring and R[X] be the polynomial ring over R. We prove that if R is a strong S-domain of finite Krull dimension and if each nonzero element of R is contained in finitely many maximal ideals of R, then each maximal ideal of R[X] of maximal height is the J max-radical of an ideal generated by two elements. We also show that if R is a Prüfer domain of finite Krull dimension with coprimely packed set of maximal ideals, then for each maximal ideal M of R, the prime ideal MR[X] of R[X] is radically perfect if and only if R is of dimension one and each maximal ideal of R is the radical of a principal ideal. We then prove that the above conditions on the Prüfer domain R also imply that a power of each finitely generated maximal ideal of R is principal. This result naturally raises the question whether the same conditions on R imply that the Picard group of R is torsion, and we prove this to be so when either R is an almost Dedekind domain or a Prüfer domain with an extra condition imposed on it.  相似文献   

14.
Our main result in this paper establishes that if G is a compact Lie subgroup of the isometry group of a compact Riemannian manifold M acting with cohomogeneity one in M and either G has no singular orbits or the singular orbits of G have dimension at most n−3, then the unit vector field N orthogonal to the principal orbits of G is weakly smooth and is a critical point of the energy functional acting on the unit normal vector fields of M. A formula for the energy of N in terms of the of integral of the Ricci curvature of M and of the integral of the square of the mean curvature of the principal orbits of G is obtained as well. In the case that M is the sphere and G the orthogonal group it is known that that N is minimizer. It is an open question if N is a minimizer in general.  相似文献   

15.
Let G be a graph of order n ? 3. We prove that if G is k-connected (k ? 2) and the degree sum of k + 1 mutually independent vertices of G is greater than 1/3(k + 1)(n + 1), then the line graph L(G) of G is pancyclic. We also prove that if G is such that the degree sum of every 2 adjacent vertices is at least n, then L(G) is panconnected with some exceptions.  相似文献   

16.
Robin Forman 《Combinatorica》2000,20(4):489-504
M   is a non-contractible subcomplex of a simplex S then M is evasive. In this paper we make this result quantitative, and show that the more non-contractible M is, the more evasive M is. Recall that M is evasive if for every decision tree algorithm A there is a face of S that requires that one examines all vertices of S (in the order determined by A) before one is able to determine whether or not lies in M. We call such faces evaders of A. M is nonevasive if and only if there is a decision tree algorithm A with no evaders. A main result of this paper is that for any decision tree algorithm A, there is a CW complex M', homotopy equivalent to M, such that the number of cells in M' is precisely
where the constant is +1 if the emptyset is not an evader of A, and -1 otherwise. In particular, this implies that if there is a decision tree algorithm with no evaders, then M is homotopy equivalent to a point. This is the theorem in [12]. In fact, in [12] it was shown that if M is non-collapsible then M is evasive, and we also present a quantitative version of this more precise statement. The proofs use the discrete Morse theory developed in [6]. Received May 7, 1999 / Revised May 17, 2000  相似文献   

17.
The Steiner distance of a set S of vertices in a connected graph G is the minimum size among all connected subgraphs of G containing S. For n ≥ 2, the n-eccentricity en(ν) of a vertex ν of a graph G is the maximum Steiner distance among all sets S of n vertices of G that contains ν. The n-diameter of G is the maximum n-eccentricity among the vertices of G while the n-radius of G is the minimum n-eccentricity. The n-center of G is the subgraph induced by those vertices of G having minimum n-eccentricity. It is shown that every graph is the n-center of some graph. Several results on the n-center of a tree are established. In particular, it is shown that the n-center of a tree is a tree and those trees that are n-centers of trees are characterized.  相似文献   

18.
Zaitov  A. A.  Ishmetov  A. Ya. 《Mathematical Notes》2019,106(3-4):562-571

A subspace If(X) of the space of idempotent probability measures on a given compact space X is constructed. It is proved that if the initial compact space X is contractible, then If(X) is a contractible compact space as well. It is shown that the shapes of the compact spaces X and If(X) are equal. It is also proved that, given a compact space X, the compact space If(X) is an absolute neighborhood retract if and only if so is X.

  相似文献   

19.
Boulabiar  Karim 《Order》2002,19(4):385-395
It is shown by P. Colville, G. Davis and K. Keimel that if R is an Archimedean f-ring then a positive group endomorphism D on R is a derivation if and only if the range of D is contained in N(R) and the kernel of D contains R 2, where N(R) is the set of all nilpotent elements in R and R 2 is the set of all products uv in R. The main objective of this paper is to establish the result corresponding to the Colville–Davis–Keimel theorem in the almost f-ring case. The result obtained in this regard is that if D is a positive derivation in an Archimedean almost f-ring, then the range of D is contained in N(R) and the kernel of D contains R 3, where R 3 is the set of all products uvw in R. Examples are produced showing that, contrary to the f-ring case, the converse is in general false and the third power is the best possible.  相似文献   

20.
A vertex of a graph is said to dominate itself and all of its neighbors.A double dominating set of a graph G is a set D of vertices of G,such that every vertex of G is dominated by at least two vertices of D.The double domination number of a graph G is the minimum cardinality of a double dominating set of G.For a graph G =(V,E),a subset D V(G) is a 2-dominating set if every vertex of V(G) \ D has at least two neighbors in D,while it is a 2-outer-independent dominating set of G if additionally the set V(G)\D is independent.The 2-outer-independent domination number of G is the minimum cardinality of a 2-outer-independent dominating set of G.This paper characterizes all trees with the double domination number equal to the 2-outer-independent domination number plus one.  相似文献   

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

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