首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   250篇
  免费   18篇
  国内免费   56篇
化学   18篇
晶体学   1篇
综合类   3篇
数学   292篇
物理学   10篇
  2023年   2篇
  2022年   4篇
  2021年   8篇
  2020年   7篇
  2019年   8篇
  2018年   4篇
  2017年   10篇
  2016年   5篇
  2015年   6篇
  2014年   15篇
  2013年   22篇
  2012年   12篇
  2011年   12篇
  2010年   14篇
  2009年   17篇
  2008年   19篇
  2007年   16篇
  2006年   15篇
  2005年   18篇
  2004年   15篇
  2003年   12篇
  2002年   11篇
  2001年   9篇
  2000年   18篇
  1999年   16篇
  1998年   14篇
  1997年   8篇
  1996年   3篇
  1995年   1篇
  1994年   1篇
  1992年   1篇
  1982年   1篇
排序方式: 共有324条查询结果,搜索用时 31 毫秒
71.
An example of a three-sheeted covering over the ball in 2 is constructed. The covering is the union of a four-dimensional ball with an analytic disk. The projection of the ball is a local homeomorphism ramified along the disk, whose projection is a part of an algebraic curve.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 206–224, August, 1996.This research was partially supported by the Russian Foundation for Basic Research under grant No. 93-011-225.  相似文献   
72.
In this paper we show the existence of smooth connected space curves not contained in a surface of degree less than , with genus maximal with respect to the degree, in half of the so-called range A. The main tool is a technique of deformation of stick-figures due to G. Fløystad.

  相似文献   

73.
In this paper we prove that the generalized permutation graph G(n,k) is upper embeddable if it has at most two odd subcycles,and that the maximum genus of G(n,k) is more than[β(G(n,k))/3]in most cases.  相似文献   
74.
Some results about the genus distributions of graphs are known,but little is known about those of digraphs.In this paper,the method of joint trees initiated by Liu is generalized to compute the embedding genus distributions of digraphs in orientable surfaces.The genus polynomials for a new kind of 4-regular digraphs called the cross-ladders in orientable surfaces are obtained.These results are close to solving the third problem given by Bonnington et al.  相似文献   
75.
二阶离散Hamiltonian系统的多重周期解   总被引:2,自引:0,他引:2  
利用变分原理和Clark定理,研究了带参数的二阶离散Hamiltonian系统的多重周期解,得到了此类方程周期解个数的下界估计.  相似文献   
76.
There are three key ingredients in the study of the minimal genus problem for rational surfaces CP2#nCP2: the generalized adjunction formula, the action of the orthogonal group of the Lorentz space and the geometric construction. In this paper, we prove the uniqueness of the standard form (see Definition 1.1 and Theorem 1.1) of a 2-dimensional homology class under the action of the subgroup of the Lorentz orthogonal group that is realized by the diffeomorphisms of CP2#nCP2.Using the geometric construction, we determine the minimal genera of some classes (see Theorem 1.2).  相似文献   
77.
1.IntroductionThernchmumgenusl7M(G),ofacormectedgraphG~(V,E)isthem~amongthegenera,amongwhichGhasacellularembeddingonaspherewithkhandles.SinceanyembeddingofGhasatleastonefaCe,byEulerpolyhedralequation,itcanbeobtainedthatwhereP(G)=IE(G)I--IV(G)l IisthecyclerankofG.AgraphGiscalledop-imbeddableif7M(C)=Lop]exactly.Kund.[1]provedthatthereareatleasttWOedge-disjointspanningtreesinGifGis4-edgecormected.LiuandXuongcharacterizedtheuptheeddabilityofgraphsasinthefollowing.Theorem1.112'31.Acorm…  相似文献   
78.
LetR be the Riemann surface of the functionu(z) specified by the equationu n=P(z) withn ε ℕ,n ≥ 2, andz ε ℂ, whereP(z) is an entire function with infinitely many simple zeros. OnR, the Riemann boundary-value problem for an arbitrary piecewise smooth contour Γ is considered. Necessary and sufficient conditions for its solvability are obtained, and its explicit solution is constructed. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 25–35, January, 2000.  相似文献   
79.
Noriaki Kamiya 《代数通讯》2013,41(6):1833-1844
It is the object of this paper to investigate the Peirce decomposition for Freudenthal-Kantor triple systems, by making use of the concept of anti-derivation of the triple systems.  相似文献   
80.
A well‐known conjecture in topological graph theory says that the genus distribution of every graph is log‐concave. In this paper, the genus distribution of the circular ladder is re‐derived, using overlap matrices and Chebyshev polynomials, which facilitates proof that this genus distribution is log‐concave.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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