首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1218篇
  免费   96篇
  国内免费   193篇
化学   22篇
力学   41篇
综合类   47篇
数学   1336篇
物理学   61篇
  2023年   15篇
  2022年   16篇
  2021年   13篇
  2020年   41篇
  2019年   30篇
  2018年   33篇
  2017年   46篇
  2016年   49篇
  2015年   27篇
  2014年   44篇
  2013年   89篇
  2012年   54篇
  2011年   60篇
  2010年   67篇
  2009年   78篇
  2008年   89篇
  2007年   93篇
  2006年   79篇
  2005年   78篇
  2004年   38篇
  2003年   83篇
  2002年   57篇
  2001年   40篇
  2000年   46篇
  1999年   53篇
  1998年   26篇
  1997年   37篇
  1996年   26篇
  1995年   18篇
  1994年   12篇
  1993年   8篇
  1992年   9篇
  1991年   6篇
  1990年   4篇
  1989年   5篇
  1988年   3篇
  1986年   3篇
  1985年   3篇
  1984年   4篇
  1983年   5篇
  1982年   4篇
  1981年   4篇
  1980年   2篇
  1979年   2篇
  1978年   2篇
  1977年   5篇
  1973年   1篇
排序方式: 共有1507条查询结果,搜索用时 31 毫秒
1.
2.
G. Peruginelli 《代数通讯》2018,46(11):4724-4738
We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.  相似文献   
3.
For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.  相似文献   
4.
5.
6.
Given and a Young function η, we consider the generalized fractional maximal operator defined by where the supremum is taken over every ball B contained in . In this article, we give necessary and sufficient Dini type conditions on the functions , and η such that is bounded from the Orlicz space into the Orlicz space . We also present a version of this result for open subsets of with finite measure. Both results generalize those contained in 6 and 14 when , respectively. As a consequence, we obtain a characterization of the functions involved in the boundedness of the higher order commutators of the fractional integral operator with BMO symbols. Moreover, we give sufficient conditions that guarantee the continuity in Orlicz spaces of a large class of fractional integral operators of convolution type with less regular kernels and their commutators, which are controlled by .  相似文献   
7.
8.
We prove Hochster’s small maximal Cohen–Macaulay conjecture for three-dimensional complete F-pure rings. We deduce this from a more general criterion, and show that only a weakening of the notion of F-purity is needed, to wit, being weakly F-split. We conjecture that any complete ring is weakly F-split.  相似文献   
9.
The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation to the canonical form y (n)=0 consists of copies of the same iterative scalar equation. It is also shown that contrary to the scalar case, an iterative vector equation need not be reducible to the canonical form by an invertible point transformation. Other properties of iterative linear systems are also derived, as well as a simple algebraic formula for their general solution. Copyright © 2017 John Wiley & Sons, Ltd.  相似文献   
10.
We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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