全文获取类型
收费全文 | 956篇 |
免费 | 68篇 |
国内免费 | 126篇 |
专业分类
化学 | 6篇 |
力学 | 2篇 |
综合类 | 11篇 |
数学 | 1077篇 |
物理学 | 54篇 |
出版年
2024年 | 4篇 |
2023年 | 24篇 |
2022年 | 29篇 |
2021年 | 17篇 |
2020年 | 50篇 |
2019年 | 33篇 |
2018年 | 42篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 27篇 |
2014年 | 25篇 |
2013年 | 109篇 |
2012年 | 27篇 |
2011年 | 50篇 |
2010年 | 41篇 |
2009年 | 60篇 |
2008年 | 86篇 |
2007年 | 53篇 |
2006年 | 55篇 |
2005年 | 49篇 |
2004年 | 29篇 |
2003年 | 45篇 |
2002年 | 46篇 |
2001年 | 37篇 |
2000年 | 23篇 |
1999年 | 42篇 |
1998年 | 37篇 |
1997年 | 21篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1150条查询结果,搜索用时 31 毫秒
151.
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral radii of G and T respectively, then, as shown by Friedman (Graphs Duke Math J 118 (2003), 19–35), in almost every n‐lift H of G, all “new” eigenvalues of H are ≤ O(λ ρ1/2). Here we improve this bound to O(λ ρ2/3). It is conjectured in (Friedman, Graphs Duke Math J 118 (2003) 19–35) that the statement holds with the bound ρ + o(1) which, if true, is tight by (Greenberg, PhD thesis, 1995). For G a bouquet with d/2 loops, our arguments yield a simple proof that almost every d‐regular graph has second eigenvalue O(d2/3). For the bouquet, Friedman (2008). has famously proved the (nearly?) optimal bound of . Central to our work is a new analysis of formal words. Let w be a formal word in letters g,…,g. The word map associated with w maps the permutations σ1,…,σk ∈ Sn to the permutation obtained by replacing for each i, every occurrence of gi in w by σi. We investigate the random variable X that counts the fixed points in this permutation when the σi are selected uniformly at random. The analysis of the expectation ??(X) suggests a categorization of formal words which considerably extends the dichotomy of primitive vs. imprimitive words. A major ingredient of a our work is a second categorization of formal words with the same property. We establish some results and make a few conjectures about the relation between the two categorizations. These conjectures suggest a possible approach to (a slightly weaker version of) Friedman's conjecture. As an aside, we obtain a new conceptual and relatively simple proof of a theorem of A. Nica (Nica, Random Struct Algorithms 5 (1994), 703–730), which determines, for every fixed w, the limit distribution (as n →∞) of X. A surprising aspect of this theorem is that the answer depends only on the largest integer d so that w = ud for some word u. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010 相似文献
152.
Dragomir
.
okovi 《组合设计杂志》2010,18(4):254-259
We show that 138 odd values of n<10000 for which a Hadamard matrix of order 4n exists have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n=191, 5767, 7081, 8249 in that range for which Hadamard matrices of order 4n exist. There is a unique equivalence class of near‐normal sequences NN(36), and the same is true for NN(38) and NN(40). This means that the Yang conjecture on the existence of near‐normal sequences NN(n) has been verified for all even n⩽40, but it still remains open. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 254–259, 2010 相似文献
153.
The vertex‐deleted subgraph G?v, obtained from the graph G by deleting the vertex v and all edges incident to v, is called a card of G. The deck of G is the multiset of its unlabelled vertex‐deleted subgraphs. The number of common cards of G and H (or between G and H) is the cardinality of the multiset intersection of the decks of G and H. In this article, we present infinite families of pairs of graphs of order n ≥ 4 that have at least \begin{eqnarray*}2\lfloor\frac{1}{3}(n-1)\rfloor\end{eqnarray*} common cards; we conjecture that these, along with a small number of other families constructed from them, are the only pairs of graphs having this many common cards, for sufficiently large n. This leads us to propose a new stronger version of the Reconstruction Conjecture. In addition, we present an infinite family of pairs of graphs with the same degree sequence that have \begin{eqnarray*}\frac{2}{3}(n+5-2\sqrt{3n+6})\end{eqnarray*} common cards, for appropriate values of n, from which we can construct pairs having slightly fewer common cards for all other values of n≥10. We also present infinite families of pairs of forests and pairs of trees with \begin{eqnarray*}2\lfloor\frac{1}{3}(n-4)\rfloor\end{eqnarray*} and \begin{eqnarray*}2\lfloor\frac{1}{3}(n-5)\rfloor\end{eqnarray*} common cards, respectively. We then present new families that have the maximum number of common cards when one graph is connected and the other disconnected. Finally, we present a family with a large number of common cards, where one graph is a tree and the other unicyclic, and discuss how many cards are required to determine whether a graph is a tree. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 146–163, 2010 相似文献
154.
Hadwiger's conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw‐free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main result is that a claw‐free graph with chromatic number χ has a clique minor of size $\lceil\frac{2}{3}\chi\rceil$. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 259–278, 2010 相似文献
155.
156.
The Cushing–Henson conjectures on time scales are presented and verified. The central part of these conjectures asserts that based on a model using the dynamic Beverton–Holt equation, a periodic environment is deleterious for the population. The proof technique is as follows. First, the Beverton–Holt equation is identified as a logistic dynamic equation. The usual substitution transforms this equation into a linear equation. Then the proof is completed using a recently established dynamic version of the generalized Jensen inequality. 相似文献
157.
G. Mazzuoccolo 《Discrete Mathematics》2013,313(20):2292-2296
158.
Crossing by lines all edges of a line arrangement 总被引:1,自引:0,他引:1
160.
After the work of G. Frey, it is known that an appropriate bound for the Faltings height of elliptic curves in terms of the conductor (Frey?s height conjecture) would give a version of the ABC conjecture. In this paper we prove a partial result towards Frey?s height conjecture which applies to all elliptic curves over , not only Frey curves. Our bound is completely effective and the technique is based in the theory of modular forms. As a consequence, we prove effective explicit bounds towards the ABC conjecture of similar strength to what can be obtained by linear forms in logarithms, without using the latter technique. The main application is a new effective proof of the finiteness of solutions to the S-unit equation (that is, S-integral points of ), with a completely explicit and effective bound, without using any variant of Baker?s theory or the Thue–Bombieri method. 相似文献