首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   256篇
  免费   21篇
  国内免费   17篇
化学   8篇
力学   24篇
综合类   2篇
数学   193篇
物理学   67篇
  2022年   3篇
  2021年   2篇
  2020年   4篇
  2019年   5篇
  2018年   7篇
  2017年   4篇
  2016年   8篇
  2015年   5篇
  2014年   10篇
  2013年   12篇
  2012年   10篇
  2011年   13篇
  2010年   11篇
  2009年   19篇
  2008年   19篇
  2007年   18篇
  2006年   13篇
  2005年   12篇
  2004年   20篇
  2003年   11篇
  2002年   10篇
  2001年   9篇
  2000年   9篇
  1999年   11篇
  1998年   11篇
  1997年   10篇
  1996年   6篇
  1995年   3篇
  1994年   7篇
  1993年   2篇
  1991年   2篇
  1990年   1篇
  1989年   1篇
  1987年   2篇
  1985年   1篇
  1984年   1篇
  1982年   2篇
排序方式: 共有294条查询结果,搜索用时 15 毫秒
21.
首次提出了一种判别样条空间S13(Δ)维数不依赖剖分几何性质的协调条件· 依此 ,在一类较一般的三角剖分下 ,获得了S13(Δ)的维数·  相似文献   
22.
23.
In this article, we present a method to obtain a C1‐surface, defined on a bounded polygonal domain Ω, which interpolates a specific dataset and minimizes a certain “energy functional.” The minimization space chosen is the one associated to the Powell–Sabin finite element, whose elements are C1‐quadratic splines. We develop a general theoretical framework for that, and we consider two main applications of the theory. For both of them, we give convergence results, and we present some numerical and graphical examples. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 798–821, 2015  相似文献   
24.
25.
A graph G with at least 2m+2 vertices is said to be distance d m-extendable if, for any matching M of G with m edges in which the edges lie at distance at least d pairwise, there exists a perfect matching of G containing M. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 m-extendable for any m.  相似文献   
26.
The surgery obstruction of a normal map to a simple Poincaré pair (X, Y) lies in the relative surgery obstruction group L *(π 1(Y) → π 1(X)). A well-known result of Wall, the so-called π-π-theorem, states that in higher dimensions a normal map of a manifold with boundary to a simple Poincaré pair with π 1(X) ? π 1(Y) is normally bordant to a simple homotopy equivalence of pairs. In order to study normal maps to a manifold with a submanifold, Wall introduced the surgery obstruction groups LP * for manifold pairs and splitting obstruction groups LS *. In the present paper, we formulate and prove for manifold pairs with boundary results similar to the π-π-theorem. We give direct geometric proofs, which are based on the original statements of Wall’s results and apply obtained results to investigate surgery on filtered manifolds.  相似文献   
27.
《Journal of Graph Theory》2018,87(4):475-491
A Grünbaum coloring of a triangulation G is a map c : such that for each face f of G, the three edges of the boundary walk of f are colored by three distinct colors. By Four Color Theorem, it is known that every triangulation on the sphere has a Grünbaum coloring. So, in this article, we investigate the question whether each even (i.e., Eulerian) triangulation on a surface with representativity at least r has a Grünbaum coloring. We prove that, regardless of the representativity, every even triangulation on a surface has a Grünbaum coloring as long as is the projective plane, the torus, or the Klein bottle, and we observe that the same holds for any surface with sufficiently large representativity. On the other hand, we construct even triangulations with no Grünbaum coloring and representativity , and 3 for all but finitely many surfaces. In dual terms, our results imply that no snark admits an even map on the projective plane, the torus, or the Klein bottle, and that all but finitely many surfaces admit an even map of a snark with representativity at least 3.  相似文献   
28.
《Journal of Graph Theory》2018,89(3):350-360
Suzuki [Discrete Math. 310 (2010), 6–11] proved that for any orientable closed surface F2 other than the sphere, there exists an optimal 1‐planar graph which can be embedded on F2 as a triangulation. However, for nonorientable closed surfaces, the existence of such graphs is unknown. In this article, we prove that no optimal 1‐planar graph triangulates a nonorientable closed surface.  相似文献   
29.
Triangulations in CGAL   总被引:7,自引:0,他引:7  
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library .  相似文献   
30.
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact, we describe how to create an automaticcatalogue of all nonorientable 3-manifolds admitting coloured triangulationswith a fixed number of tetrahedra. In particular, the catalogue has been effectively produced and analysed for up to 26 tetrahedra, to reach the complete classification of all involved 3-manifolds. As a consequence, the following summarising result can be stated:THEOREM I. Exactly seven closed connected prime nonorientable3-manifolds exist, which admit a coloured triangulation consisting of atmost 26 tetrahedra.More precisely, they are the four Euclidean nonorientable 3-manifolds, the nontrivial S2 bundle overS1, the topological product between thereal projective plane RP2 andS1, and the torus bundle overS1, with monodromy induced by matrix(10 -11).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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