首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   413篇
  免费   35篇
  国内免费   33篇
化学   26篇
晶体学   1篇
力学   9篇
综合类   8篇
数学   335篇
物理学   102篇
  2023年   2篇
  2022年   4篇
  2021年   6篇
  2020年   20篇
  2019年   10篇
  2018年   12篇
  2017年   13篇
  2016年   14篇
  2015年   8篇
  2014年   14篇
  2013年   50篇
  2012年   13篇
  2011年   25篇
  2010年   26篇
  2009年   25篇
  2008年   37篇
  2007年   40篇
  2006年   22篇
  2005年   23篇
  2004年   17篇
  2003年   13篇
  2002年   12篇
  2001年   7篇
  2000年   10篇
  1999年   14篇
  1998年   2篇
  1997年   7篇
  1996年   2篇
  1995年   3篇
  1994年   2篇
  1993年   5篇
  1992年   2篇
  1991年   2篇
  1990年   2篇
  1989年   2篇
  1988年   2篇
  1987年   1篇
  1985年   4篇
  1984年   2篇
  1983年   1篇
  1982年   2篇
  1981年   1篇
  1980年   1篇
  1976年   1篇
排序方式: 共有481条查询结果,搜索用时 31 毫秒
1.
2.
3.
We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.  相似文献   
4.
We investigate some topological properties of a normal functorH introduced earlier by Radul which is some functorial compactification of the Hartman-Mycielski construction HM. We prove that the pair (H X, HMY) is homeomorphic to the pair (Q, σ) for each nondegenerated metrizable compactumX and each denseσ-compact subsetY.  相似文献   
5.
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].  相似文献   
6.
Searching in trees   总被引:1,自引:0,他引:1  
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.  相似文献   
7.
A cube factorization of the complete graph on n vertices, Kn, is a 3‐factorization of Kn in which the components of each factor are cubes. We show that there exists a cube factorization of Kn if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.  相似文献   
8.
We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z -points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: KX of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X 2 and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space Xχ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Yχ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)  相似文献   
9.
Let μ be a Borel measure on Rd which may be non doubling. The only condition that μ must satisfy is μ(Q) ≤ col(Q)n for any cube Q () Rd with sides parallel to the coordinate axes and for some fixed n with 0 < n ≤ d. The purpose of this paper is to obtain a boundedness property of fractional integrals in Hardy spaces H1 (μ).  相似文献   
10.
利用第一类Chebyshev多项式的性质以及其与Lucas数的关系得到了关于Lucas数立方的一些恒等式.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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