首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   502篇
  免费   17篇
  国内免费   53篇
化学   5篇
力学   14篇
综合类   11篇
数学   527篇
物理学   15篇
  2024年   1篇
  2023年   10篇
  2022年   8篇
  2021年   7篇
  2020年   10篇
  2019年   6篇
  2018年   20篇
  2017年   24篇
  2016年   7篇
  2015年   6篇
  2014年   20篇
  2013年   61篇
  2012年   17篇
  2011年   24篇
  2010年   17篇
  2009年   25篇
  2008年   26篇
  2007年   39篇
  2006年   30篇
  2005年   29篇
  2004年   14篇
  2003年   24篇
  2002年   19篇
  2001年   14篇
  2000年   27篇
  1999年   19篇
  1998年   12篇
  1997年   21篇
  1996年   6篇
  1995年   7篇
  1994年   2篇
  1993年   3篇
  1991年   1篇
  1990年   2篇
  1989年   2篇
  1988年   1篇
  1987年   1篇
  1984年   1篇
  1983年   1篇
  1982年   1篇
  1981年   1篇
  1980年   3篇
  1979年   1篇
  1969年   1篇
  1959年   1篇
排序方式: 共有572条查询结果,搜索用时 15 毫秒
1.
Let L be an additive map between (real or complex) matrix algebras sending n×n Hermitian idempotent matrices to m×m Hermitian idempotent matrices. We show that there are nonnegative integers p,q with n(p+q)=rm and an m×m unitary matrix U such thatL(A)=U[(Ip?A)(Iq?At)0m?r]U?,for any n×n Hermitian A with rational trace. We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism.  相似文献   
2.
马捷  杨虎 《数学进展》2006,35(3):275-284
在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C.R.Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C.R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C.R.Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质.  相似文献   
3.
Matrix extensions and eigenvalue completions, the generic case   总被引:2,自引:0,他引:2  
In this paper we provide new necessary and sufficient conditions for the so-called eigenvalue completion problem.

  相似文献   

4.
Let R be an associative ring with unit and let N(R) denote the set of nilpotent elements of R. R is said to be stronglyπ-regular if for each xR, there exist a positive integer n and an element yR such that x n=x n +1 y and xy=yx. R is said to be periodic if for each xR there are integers m,n≥ 1 such that mn and x m=x n. Assume that the idempotents in R are central. It is shown in this paper that R is a strongly π-regular ring if and only if N(R) coincides with the Jacobson radical of R and R/N(R) is regular. Some similar conditions for periodic rings are also obtained. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
5.
Let Top 0 be the category of topological T 0-spaces, QU 0 the category of quasi-uniform T 0-spaces, T : QU 0 Top 0 the usual forgetful functor and K : QU 0 QU 0 the bicompletion reflector with unit k : 1 → K. Any T-section F : Top 0 QU 0 is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU 0 is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).  相似文献   
6.
7.
We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the second — to the cardinality of a set of special elements, of the initial numbering. Supported by INTAS grant No. 00-429. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007.  相似文献   
8.
半群K(n,r)中的幂等生成元   总被引:1,自引:0,他引:1  
游泰杰 《数学进展》2002,31(3):284-286
设Singn是由一个n元集上的所有奇异变换所构成的奇异变换半群,I是由Singn中一些亏数为1的幂等元组成的集合,Howie利用有向图证明了:I是Singn的一个生成集当且仅当与其相应的有向图D(I)是强连通的完全图,本文利用多重有向图将这一结果推广到Singn的每个理想K(,r)上。  相似文献   
9.
A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when identifies an X-tree, and the second describes when a compatible subset of is of maximum size.  相似文献   
10.
We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BBT for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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