首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   905篇
  免费   49篇
  国内免费   86篇
化学   66篇
力学   11篇
综合类   19篇
数学   899篇
物理学   45篇
  2023年   11篇
  2022年   12篇
  2021年   19篇
  2020年   16篇
  2019年   33篇
  2018年   38篇
  2017年   42篇
  2016年   40篇
  2015年   17篇
  2014年   36篇
  2013年   125篇
  2012年   22篇
  2011年   40篇
  2010年   43篇
  2009年   52篇
  2008年   51篇
  2007年   35篇
  2006年   43篇
  2005年   42篇
  2004年   39篇
  2003年   37篇
  2002年   34篇
  2001年   27篇
  2000年   40篇
  1999年   23篇
  1998年   22篇
  1997年   19篇
  1996年   10篇
  1995年   5篇
  1994年   10篇
  1993年   5篇
  1992年   5篇
  1991年   6篇
  1990年   7篇
  1989年   4篇
  1988年   1篇
  1987年   1篇
  1986年   3篇
  1985年   6篇
  1984年   6篇
  1983年   1篇
  1982年   2篇
  1981年   2篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1977年   2篇
  1974年   1篇
  1973年   2篇
排序方式: 共有1040条查询结果,搜索用时 109 毫秒
151.
Let 𝔽 be a field of characteristic two. Let S n (𝔽) denote the vector space of all n?×?n symmetric matrices over 𝔽. We characterize i. subspaces of S n (𝔽) all whose elements have rank at most two where n???3,

ii. linear maps from S m (𝔽) to S n (𝔽) that sends matrices of rank at most two into matrices of rank at most two where m, n???3 and |𝔽|?≠?2.

  相似文献   
152.
A number of characterizations involving column and null spaces of various functions of a pair of oblique projectors are established. Particular attention is paid to properties of a product of the two projectors, but other functions of the pair (such as sum, difference or sum and difference of products) are considered as well. In many cases, the results obtained generalize those already known to be valid for orthogonal projectors.  相似文献   
153.
154.
In this paper, we study lower bounds on the size of a maximum independent set and a maximum matching in a hypergraph of rank three. The rank in a hypergraph is the size of a maximum edge in the hypergraph. A hypergraph is simple if no two edges contain exactly the same vertices. Let H be a hypergraph and let and be the size of a maximum independent set and a maximum matching, respectively, in H, where a set of vertices in H is independent (also called strongly independent in the literature) if no two vertices in the set belong to a common edge. Let H be a hypergraph of rank at most three and maximum degree at most three. We show that with equality if and only if H is the Fano plane. In fact, we show that if H is connected and different from the Fano plane, then and we characterize the hypergraphs achieving equality in this bound. Using this result, we show that that if H is a simple connected 3‐uniform hypergraph of order at least 8 and with maximum degree at most three, then and there is a connected 3‐uniform hypergraph H of order 19 achieving this lower bound. Finally, we show that if H is a connected hypergraph of rank at most three that is not a complete hypergraph on vertices, where denotes the maximum degree in H, then and this bound is asymptotically best possible. © 2012 Wiley Periodicals, Inc. J. Graph Theory  相似文献   
155.
156.
Let S be a semigroup of words over an alphabet ∑ . Suppose tliar every two words u and e over ∑ are equal in S if (1) the sets of subwords of length k of the words a and b coincide and are non-empty. (2) the prefix (suffix) of u of length k1 is equal to the prefix (suffix) of e. Then S is called k-testable. A semigroup is locally testable if it is k-testable for some k > 0.

We present a finite basis of identities of the variety of A'-testable semigroups. The structure of k-testable semigroup is studied. Necessarv and sufficient conditions for local testability will be given. A solution to one problem from the survey of Shevrin and Sukhanov (1985) will be presented.  相似文献   
157.
A. Kirk 《代数通讯》2013,41(9):3357-3386
Tararin has shown that a non-Abelian group G admits a nonzero finite number of distinct right-orders if and only if G is equipped with a Tararin-type series of some length n. Further, a group which has a Tararin-type series of length n admits 2 n right-orders. It is known that a group has two right-orders if and only if it is torsionfree Abelian of rank 1. Here we completely classify the groups which admit either four or eight right-orders.  相似文献   
158.
Sh. Asgari  M. R. Vedadi 《代数通讯》2013,41(5):1801-1816
We carry out an extensive study of modules M R with the property that M/f(M) is singular for all injective endomorphisms f of M. Such modules called “quasi co-Hopfian”, generalize co-Hopfian modules. It is shown that a ring R is semisimple if and only if every quasi co-Hopfian R-module is co-Hopfian. Every module contains a unique largest fully invariant quasi co-Hopfian submodule. This submodule is determined for some modules including the semisimple ones. Over right nonsingular rings several equivalent conditions to being quasi co-Hopfian are given. Modules with all submodules quasi co-Hopfian are called “completely quasi co-Hopfian” (cqcH). Over right nonsingular rings and over certain right Noetherian rings, it is proved that every finite reduced rank module is cqcH. For a right nonsingular ring which is right semi-Artinian (resp. right FBN) the class of cqcH modules is the same as the class of finite reduced rank modules if and only if there are only finitely many isomorphism classes of nonsingular R-modules which are simple (resp. indecomposable injective).  相似文献   
159.
胡婧玮 《计算数学》2022,44(3):289-304
玻尔兹曼方程作为空气动理学中最基本的方程之一,是连接微观牛顿力学和宏观连续介质力学的重要桥梁.该方程描述了一个由大量粒子组成的复杂系统的非平衡态时间演化:除了基本的输运项,其最重要的特性是粒子间的相互碰撞由一个高维,非局部且非线性的积分算子来描述,从而给玻尔兹曼方程的数值求解带来非常大的挑战.在过去的二十年间,基于傅里叶级数的谱方法成为了数值求解玻尔兹曼方程的一种很受欢迎且有效的确定性算法.这主要归功于谱方法的高精度及它可以被快速傅里叶变换加速的特质.本文将回顾玻尔兹曼方程的傅里叶谱方法,具体包括方法的导出,稳定性和收敛性分析,快速算法,以及在一大类基于碰撞的空气动理学方程中的推广.  相似文献   
160.
We define Euler characteristics on classes of residually finite and virtually torsion free groups and we show that they satisfy certain formulas in the case of amalgamated free products and HNN extensions over finite subgroups. These formulas are obtained from a general result which applies to the rank gradient and the first L2?Betti number of a finitely generated group.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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