首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   527篇
  免费   44篇
  国内免费   81篇
化学   8篇
综合类   27篇
数学   606篇
物理学   11篇
  2024年   1篇
  2023年   2篇
  2022年   6篇
  2021年   7篇
  2020年   12篇
  2019年   16篇
  2018年   17篇
  2017年   15篇
  2016年   8篇
  2015年   9篇
  2014年   19篇
  2013年   46篇
  2012年   26篇
  2011年   18篇
  2010年   19篇
  2009年   35篇
  2008年   32篇
  2007年   36篇
  2006年   31篇
  2005年   34篇
  2004年   26篇
  2003年   32篇
  2002年   38篇
  2001年   29篇
  2000年   40篇
  1999年   29篇
  1998年   12篇
  1997年   16篇
  1996年   12篇
  1995年   3篇
  1994年   8篇
  1993年   2篇
  1992年   1篇
  1991年   1篇
  1990年   3篇
  1989年   4篇
  1985年   2篇
  1984年   3篇
  1982年   1篇
  1936年   1篇
排序方式: 共有652条查询结果,搜索用时 0 毫秒
121.
给出仿射代数集上多项式自同态为同构的Grobner基准则,井利用Wu-Ritt算法进行了计算,同时给出一些具体例子.  相似文献   
122.
It is proved that an o-2-transitive group of order automorphisms of a totally ordered set with Abelian stabilizer of a point is the permutation groupF={φ(a, b)‖a, bεP, a>0, (x)φ(a, b)=xa+b forxεP} of a totally ordered fieldP. Translated fromMatematicheskie Zametki, Vol. 65, No. 2, pp. 289–293, February, 1999.  相似文献   
123.
A Dehn twist automorphism of a group G is an automorphism which can be given (as specified below) in terms of a graph-of-groups decomposition of G with infinite cyclic edge groups. The classic example is that of an automorphism of the fundamental group of a surface which is induced by a Dehn twist homeomorphism of the surface. For , a non-abelian free group of finite rank n, a normal form for Dehn twist is developed, and it is shown that this can be used to solve the conjugacy problem for Dehn twist automorphisms of . Received: February 12, 1996.  相似文献   
124.
A new symmetric non‐self‐dual design with parameters (176, 50, 14) is constructed, where its full automorphism group of order 1000 is a faithful extension of the non‐abelian group of order 125 and exponent 5 by the cyclic group of order 8. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 387–390, 2000  相似文献   
125.
The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predetermining automorphisms of desired covering designs. A stochastic heuristic search (embedded in the general framework of tabu search) is then used to find appropriate sets of orbits. A table of upper bounds on C(v, t + 1, t) for v 28 and t 8 is given, and the new covering designs are listed. © 1999 John Wiley & Sons, Inc. J. Combin Designs 7: 217–226, 1999  相似文献   
126.
Consider the flag-transitive 2-(v, k, λ) symmetric designs with (k, λ) = 1. We prove that if D is a nontrivial 2-(v, k, λ) symmetric design with (k, λ) = 1 and G≤Aut(D) is flag-transitive with Soc(G) = An for n≥5, then D is the projective space PG2(3,2) and G = A7.  相似文献   
127.
We prove that the free metabelian Lie algebra M 3 of rank 3 over an arbitrary field K admits strictly nontame primitive elements.  相似文献   
128.
给出了C~3中一类拟凸超曲面定义在原点邻域内的实解析无穷小CR自同构,并得到了这类超曲面在原点处稳定群的单位连通分支.  相似文献   
129.
This paper gets the Beltrami equations satisfied by a 1-quasiconformal mapping, which are exactly CR or anti-CR equations on (2,2)-type quadric Q0. This means a 1-quasiconformal mapping on Q0 is CR or anti-CR. This reduces the determination of 1- quasiconformal mappings to a problem on the theory of several complex analysis. The result about the group of CR automorphisms is used to determine the unit component of group of 1-quasiconformal mappings.  相似文献   
130.
In this paper, a finite group G with IAut(G) : P(G)I ~- p or pq is determined, where P(G) is the power automorphism group of G, and p, q are distinct primes. Especially, we prove that a finite group G satisfies |Aut(G) : P(G)|= pq if and only if Aut(G)/P(G) ≌S3. Also, some other classes of finite groups are investigated and classified, which are necessary for the proof of our main results.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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