首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   185篇
  免费   6篇
  国内免费   10篇
化学   15篇
力学   2篇
数学   178篇
物理学   6篇
  2024年   2篇
  2023年   3篇
  2022年   4篇
  2021年   4篇
  2020年   6篇
  2019年   8篇
  2018年   10篇
  2017年   4篇
  2016年   3篇
  2015年   2篇
  2014年   4篇
  2013年   14篇
  2012年   3篇
  2011年   4篇
  2010年   7篇
  2009年   20篇
  2008年   16篇
  2007年   13篇
  2006年   13篇
  2005年   9篇
  2004年   3篇
  2003年   5篇
  2002年   6篇
  2001年   4篇
  2000年   6篇
  1999年   6篇
  1998年   7篇
  1997年   4篇
  1996年   3篇
  1994年   1篇
  1993年   1篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
  1984年   1篇
  1981年   1篇
  1978年   1篇
排序方式: 共有201条查询结果,搜索用时 15 毫秒
191.
In this paper we construct Almansi decompositions for powers of the ultrahyperbolic operator. The construction will be done in a constructive way.  相似文献   
192.
    
We define and investigate the Triebel - Lizorkin scale of function spaces F, with 1< p < ∞, 1< q ≤ ∞ for the Fourier-Helgason transform on symmetric Riemannian manifolds of the noncompact type.  相似文献   
193.
    
It is shown that if F1, F2, …, Ft are bipartite 2‐regular graphs of order n and α1, α2, …, αt are positive integers such that α1 + α2 + ? + αt = (n ? 2)/2, α1≥3 is odd, and αi is even for i = 2, 3, …, t, then there exists a 2‐factorization of Kn ? I in which there are exactly αi 2‐factors isomorphic to Fi for i = 1, 2, …, t. This result completes the solution of the Oberwolfach problem for bipartite 2‐factors. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:22‐37, 2011  相似文献   
194.
    
A graph G is (k,0)‐colorable if its vertices can be partitioned into subsets V1 and V2 such that in G[V1] every vertex has degree at most k, while G[V2] is edgeless. For every integer k?0, we prove that every graph with the maximum average degree smaller than (3k+4)/(k+2) is (k,0)‐colorable. In particular, it follows that every planar graph with girth at least 7 is (8, 0)‐colorable. On the other hand, we construct planar graphs with girth 6 that are not (k,0)‐colorable for arbitrarily large k. © 2009 Wiley Periodicals, Inc. J Graph Theory 65:83–93, 2010  相似文献   
195.
    
In this article, we introduce a new technique for obtaining cycle decompositions of complete equipartite graphs from cycle decompositions of related multigraphs. We use this technique to prove that if n, m and λ are positive integers with n ≥ 3, λ≥ 3 and n and λ both odd, then the complete equipartite graph having n parts of size m admits a decomposition into cycles of length λ2 whenever nm ≥ λ2 and λ divides m. As a corollary, we obtain necessary and sufficient conditions for the decomposition of any complete equipartite graph into cycles of length p2, where p is prime. © 2010 Wiley Periodicals, Inc. J Combin Designs 18:401‐414, 2010  相似文献   
196.
    
Dorin Popescu 《代数通讯》2013,41(11):4351-4362
We show that the Stanley's Conjecture holds for an intersection of four monomial prime ideals of a polynomial algebra S over a field and for an arbitrary intersection of monomial prime ideals (P i ) i∈[s] of S such that each P i is not contained in the sum of the other (P j ) ji .  相似文献   
197.
    
A recurrent theme in functional analysis is the interplay between the theory of positive definite functions and their reproducing kernels on the one hand, and Gaussian stochastic processes on the other. This central theme is motivated by a host of applications in mathematical physics. In this article, we show that it is possible to obtain explicit formulas amenable to computations of the respective Gaussian stochastic processes. To achieve this, we first develop two functional analytic tools. These are the identification of a universal sample space Ω where we realize the particular Gaussian processes in the correspondence, a procedure for discretizing computations in Ω. Our processes are as follows: Processes associated with arbitrarily given sigma finite regular measures on a fixed Borel measure space, with Hilbert spaces of sigma-functions, and with systems of self-similar measures arising in the theory of iterated function systems. In our last theorem, starting with a non-degenerate positive definite function K on some fixed set T, we show that there is a choice of a universal sample space Ω which can be realized as a boundary of (T, K). Its boundary-theoretic properties are analyzed, and we point out their relevance to the study of electrical networks on countable infinite graphs.  相似文献   
198.
    
Given two graphs F and G, an induced F‐decomposition of G is a partition of into induced subgraphs isomorphic to F. Bondy and Szwarcfiter [J. Graph Theory, DOI: 10.1002/jgt.21654] defined the value as the maximum number of edges in a graph of order n admitting an induced F‐decomposition and determined the value of for some graphs (and families of graphs). In this article, we prove that is valid for all graphs F. We also present tighter asymptotic bounds for some of the small graphs for which the exact value of remains unknown. The proofs are based on the heavy use of various classes of Kneser graphs and hypergraphs.  相似文献   
199.
We show that residually finite or word hyperbolic groups which can be decomposed as a finite union of double cosets of a cyclic subgroup are necessarily virtually cyclic, and we apply this result to the study of Frobenius permutation groups. We show that in general, finite double coset decompositions of a group can be interpreted as an obstruction to splitting a group as a free product with amalgamation or an HNN extension.  相似文献   
200.
    
In this note we give a structure theorem for a finite-dimensional subgroup of the automorphism group of a compact symplectic manifold. An application of this result is a simpler and more transparent proof of the classification of compact homogeneous spaces with invariant symplectic structures. We also give another proof of the classification from the general theory of compact homogeneous spaces which leads us to a splitting conjecture on compact homogeneous spaces with symplectic structures (which are not necessary invariant under the group action) that makes the classification of this kind of manifold possible.

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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