全文获取类型
收费全文 | 380篇 |
免费 | 26篇 |
国内免费 | 39篇 |
专业分类
化学 | 8篇 |
力学 | 1篇 |
综合类 | 1篇 |
数学 | 404篇 |
物理学 | 31篇 |
出版年
2024年 | 3篇 |
2023年 | 6篇 |
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 10篇 |
2019年 | 10篇 |
2018年 | 14篇 |
2017年 | 7篇 |
2016年 | 13篇 |
2015年 | 9篇 |
2014年 | 10篇 |
2013年 | 21篇 |
2012年 | 5篇 |
2011年 | 22篇 |
2010年 | 21篇 |
2009年 | 23篇 |
2008年 | 39篇 |
2007年 | 22篇 |
2006年 | 31篇 |
2005年 | 22篇 |
2004年 | 17篇 |
2003年 | 21篇 |
2002年 | 20篇 |
2001年 | 16篇 |
2000年 | 16篇 |
1999年 | 16篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1981年 | 1篇 |
1977年 | 2篇 |
排序方式: 共有445条查询结果,搜索用时 15 毫秒
1.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
2.
We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence. 相似文献
3.
M.V. Devyaterikova 《Operations Research Letters》2006,34(2):149-154
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed. 相似文献
4.
有限群表示的一个结论 总被引:1,自引:0,他引:1
张玉成 《数学的实践与认识》2004,34(3):116-119
利用陪集、重陪集等概念和性质 ,证明了一个利用有限群 G的子集表示 G的结论 . 相似文献
5.
New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered. 相似文献
6.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
7.
We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved. 相似文献
8.
Several sophisticated methods to solution of symmetry specified enumeration problems are available in the modern literature.
In this paper we propose a simple technique that allows one to manually compute the exact numbers of fixed-symmetry derivatives
for a given structure either with inclusion or ignoring the substitution patterns. The basic idea of the method suggested
consists in the derivation of Pólya-like cycle indices for the automorphism groups of specially constructed orbit partition
graphs; the expansion of these indices and subsequent simple calculations result in the desired numbers of substituted derivatives
with achiral substituents. Limitations of the new technique (and a method suggested earlier) depend on the relevance of the
orbit partitions for particular subgroups of the point symmetry group. For illustration purposes, the results obtained for
the prismane (D
3h
) and adamantane (T
d
) structures are discussed. In the former case the numbers of substituted derivatives can be found for all subgroups of the
D
3h
group, whereas in the latter case these numbers can be determined for eight out of eleven subgroups of the T
d
point symmetry group.
This work is based on the text of the lecture presented by the authors at the 5th All-Russia Conference on Molecular Modeling
(Moscow, April 2007). The paper deals with the methodology and detailed treatment of applied aspects related to solution of
enumeration problems for substituted derivatives with prescribed symmetry groups. Unlike the known methods of symmetry specified
enumeration, the technique suggested is simple enough and may be regarded as generalization of the Pólya methodology, which
is widely used by chemists.
Published in Russian in Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 227–245, February, 2008. 相似文献
9.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
10.
N. M. Bogoliubov 《Theoretical and Mathematical Physics》2007,150(2):165-174
We establish a relation between an exactly solvable boson model and plane partitions, i.e., three-dimensional Young diagrams
enclosed in a box of finite size, which allows representing the partition generating functions as correlation functions of
an integrable model and deriving the MacMahon formulas for enumerating partitions using the quantum inverse scattering method.
__________
Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 2, pp. 193–203, February, 2007. 相似文献