首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   986篇
  免费   65篇
  国内免费   126篇
化学   16篇
力学   3篇
综合类   11篇
数学   1087篇
物理学   60篇
  2024年   6篇
  2023年   24篇
  2022年   31篇
  2021年   17篇
  2020年   52篇
  2019年   33篇
  2018年   42篇
  2017年   27篇
  2016年   16篇
  2015年   28篇
  2014年   25篇
  2013年   110篇
  2012年   27篇
  2011年   50篇
  2010年   43篇
  2009年   61篇
  2008年   87篇
  2007年   54篇
  2006年   57篇
  2005年   50篇
  2004年   29篇
  2003年   45篇
  2002年   46篇
  2001年   38篇
  2000年   23篇
  1999年   43篇
  1998年   38篇
  1997年   21篇
  1996年   14篇
  1995年   5篇
  1994年   3篇
  1993年   5篇
  1992年   6篇
  1991年   3篇
  1990年   4篇
  1989年   2篇
  1988年   1篇
  1985年   3篇
  1984年   2篇
  1982年   1篇
  1979年   2篇
  1977年   1篇
  1975年   1篇
  1974年   1篇
排序方式: 共有1177条查询结果,搜索用时 15 毫秒
981.
A classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[T] has infinitely many prime values unless there is a local obstruction. Replacing Z[T] with κ[u][T], where κ is a finite field, the obvious analogue of Bouniakowsky's conjecture is false. All known counterexamples can be explained by a new obstruction, and this obstruction can be used to fix the conjecture. The situation is more subtle in characteristic 2 than in odd characteristic. Here, we illustrate the general theory for characteristic 2 in some examples.  相似文献   
982.
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck—the collection of its vertex‐deleted subgraphs. Kocay's Lemma is an important tool in graph reconstruction. Roughly speaking, given the deck of a graph G and any finite sequence of graphs, it gives a linear constraint that every reconstruction of G must satisfy. Let be the number of distinct (mutually nonisomorphic) graphs on n vertices, and let be the number of distinct decks that can be constructed from these graphs. Then the difference measures how many graphs cannot be reconstructed from their decks. In particular, the graph reconstruction conjecture is true for n‐vertex graphs if and only if . We give a framework based on Kocay's lemma to study this discrepancy. We prove that if M is a matrix of covering numbers of graphs by sequences of graphs, then . In particular, all n‐vertex graphs are reconstructible if one such matrix has rank . To complement this result, we prove that it is possible to choose a family of sequences of graphs such that the corresponding matrix M of covering numbers satisfies .  相似文献   
983.
陈凤娟 《数学学报》2017,60(6):977-982
1913年,Frobenius对Markoff方程a~2+b~2+c~2=3abc提了一个著名猜想:若abc是Markoff方程的正整数解,则a,b的值由最大的数c唯一确定.此猜想仍未得到解决.本文证明了:任给定正整数s_i,t_i,w,u,v=1,2),若(a_i,b_i,c)是Markoff方程的两组不同的正整数解,且a_ib_ic(i=1,2),则gcd(s_1a_1+s_2a_2+t_1b_1+t_2b_2+w,uc+v)≤K(uc+v)~(13/14),其中K是仅与s_i,t_i,w,u,v(i=1,2)有关的正数.  相似文献   
984.
985.
We obtain new evidence for the Purely Wild Inertia Conjecture posed by Abhyankar and for its generalization. We show that this generalized conjecture is true for any product of simple Alternating groups in odd characteristics, and for any product of certain Symmetric or Alternating groups in characteristic two. We also obtain important results towards the realization of the inertia groups which can be applied to more general set up. We further show that the Purely Wild Inertia Conjecture is true for any product of perfect quasi p-groups (groups generated by their Sylow p-subgroups) if the conjecture is established for individual groups.  相似文献   
986.
Let(a, b, c) be a primitive Pythagorean triple. Je′smanowicz conjectured in 1956 that for any positive integer n, the Diophantine equation(an)x+(bn)y=(cn)z has only the positive integer solution(x, y, z) =(2, 2, 2). Let p ≡ 3(mod 4) be a prime and s be some positive integer. In the paper, we show that the conjecture is true when(a, b, c) =(4p2s-1, 4p s, 4p2s+ 1) and certain divisibility conditions are satisfied.  相似文献   
987.
The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Namely, it is shown that i(G) ≤ + 1. It is also observed that the edge bound induces i(G) ≤ , where γ(G) is the genus of G. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 153–159, 1999  相似文献   
988.
In this paper, we study the thermodynamics and the weak cosmic censorship conjecture of the nonlinear electrodynamics black hole under the scattering of a charged complex scalar field.According to the energy and charge fluxes of the scalar field, the variations of this black hole's energy and charge can be calculated during an infinitesimal time interval. With scalar field scattering, the variation of the black hole is calculated in the extended and normal phase spaces.In the normal phase space, the cosmological constant and the normalization parameter are fixed,and the first and second laws of thermodynamics can also be satisfied. In the extended phase space, the cosmological constant and the normalization parameter are considered as thermodynamic variables, and the first law of thermodynamics is valid, but the second law of thermodynamics is not valid. Furthermore, the weak cosmic censorship conjecture is both valid in the extended and normal phase spaces.  相似文献   
989.
黑洞与奇点     
黑洞可以说是引力最极端的体现,其视界内是个连光也逃不出去的时空区域。近来黑洞在天 文观测方面取得令人惊讶的发展,这其中包括:黑洞碰撞的引力波探测以及M87 星系的超大质量 黑洞的所谓第一张黑洞照片。但是在理论的层面上,黑洞物理尚有许多未解之谜。其中,信息遗失 的悖论是最有名的。但是,有另一个问题至少和信息的丢失一样{甚至更加{令人费解的,就是黑洞 内部的奇点性质。时空奇点是广义相对论本身无法描述的,在那里究竟发生什么事?黑洞内部的奇 点和宇宙大爆炸时的奇点有何不同?奇点是否会裸露在黑洞外面?所谓“宇宙监督猜想”的假设目 前有何进展?我们在这篇半科普的文章中简单的介绍这些课题,希望本文章对物理和数学的本科生 有所帮助。  相似文献   
990.
Let M be a closed orientable surface and let ϕ be a C1‐flow on M with set of singularities compact countable. In this paper, we prove the Morse conjecture for ϕ: if ϕ is topologically transitive then it is metrically transitive.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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