首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   805篇
  免费   40篇
  国内免费   37篇
化学   99篇
力学   60篇
综合类   32篇
数学   573篇
物理学   118篇
  2024年   1篇
  2023年   7篇
  2022年   20篇
  2021年   23篇
  2020年   35篇
  2019年   34篇
  2018年   24篇
  2017年   29篇
  2016年   15篇
  2015年   17篇
  2014年   25篇
  2013年   74篇
  2012年   21篇
  2011年   43篇
  2010年   37篇
  2009年   54篇
  2008年   42篇
  2007年   41篇
  2006年   44篇
  2005年   39篇
  2004年   28篇
  2003年   24篇
  2002年   26篇
  2001年   28篇
  2000年   21篇
  1999年   21篇
  1998年   18篇
  1997年   16篇
  1996年   12篇
  1995年   8篇
  1994年   13篇
  1993年   5篇
  1992年   8篇
  1991年   1篇
  1990年   5篇
  1989年   4篇
  1988年   1篇
  1987年   2篇
  1986年   2篇
  1985年   3篇
  1984年   4篇
  1983年   2篇
  1982年   3篇
  1981年   1篇
  1968年   1篇
排序方式: 共有882条查询结果,搜索用时 15 毫秒
41.
We consider a nearest-neighbor p-adic Potts (with q ≥ 2 spin values and coupling constant J ? p) model on the Cayley tree of order k ≥ 1. It is proved that a phase transition occurs at k = 2, q ? p and p ≥ 3 (resp. q ? 22, p = 2). It is established that for p-adic Potts model at k ≥ 3 a phase transition may occur only at q ? p if p ≥ 3 and q ? 22 if p = 2.  相似文献   
42.
43.
Abstract We prove that there are non-recursive r.e. sets A and C with A < T C such that for every set . Both authors are supported by “863” and the National Science Foundation of China  相似文献   
44.
The notion of Cayley color graphs of groups is generalized to inverse semigroups and groupoids. The set of partial automorphisms of the Cayley color graph of an inverse semigroup or a groupoid is isomorphic to the original inverse semigroup or groupoid. The groupoid of color permuting partial automorphisms of the Cayley color graph of a transitive groupoid is isomorphic to the original groupoid.  相似文献   
45.
We point out a countable set of pairwise nonisomorphic Cayley graphs of the group ℤ4 that are limit for finite minimal vertex-primitive graphs admitting a vertex-primitive automorphism group containing a regular Abelian normal subgroup. Supported by RFBR grant No. 06-01-00378. __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 203–214, March–April, 2008.  相似文献   
46.
We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.  相似文献   
47.
Tutte’s 3-Flow Conjecture suggests that every bridgeless graph with no 3-edge-cut can have its edges directed and labelled by the numbers 1 or 2 in such a way that at each vertex the sum of incoming values equals the sum of outgoing values. In this paper we show that Tutte’s 3-Flow Conjecture is true for Cayley graphs of groups whose Sylow 2-subgroup is a direct factor of the group; in particular, it is true for Cayley graphs of nilpotent groups. This improves a recent result of Potočnik et al. (Discrete Math. 297:119–127, 2005) concerning nowhere-zero 3-flows in abelian Cayley graphs.  相似文献   
48.
We characterize the automorphism groups of quasiprimitive 2-arc-transitive graphs of twisted wreath product type. This is a partial solution for a problem of Praeger regarding quasiprimitive 2-arc transitive graphs. The solution stimulates several further research problems regarding automorphism groups of edge-transitive Cayley graphs and digraphs. This work forms part of an ARC grant project and is supported by a QEII Fellowship.  相似文献   
49.
Let G be a simple Lie group of real rank one and N be in the Iwasawa decomposition of G. We prove a refined version of the Sobolev inequality on N in presence of symmetry.  相似文献   
50.
George Boole and the origins of invariant theory   总被引:1,自引:0,他引:1  
Historians have repeatedly asserted that invariant theory was born in two papers of George Boole (1841 and 1842). Although several themes and techniques of 19th-century invariant theory are enunciated in this work, in reacting to it (and thereby founding the British school of invariant theory), Arthur Cayley shifted Boole's research program.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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