全文获取类型
收费全文 | 117篇 |
免费 | 4篇 |
国内免费 | 5篇 |
专业分类
化学 | 1篇 |
力学 | 1篇 |
数学 | 120篇 |
物理学 | 4篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 3篇 |
2016年 | 4篇 |
2015年 | 1篇 |
2014年 | 2篇 |
2013年 | 7篇 |
2012年 | 1篇 |
2011年 | 4篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2008年 | 11篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1988年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有126条查询结果,搜索用时 154 毫秒
1.
The exponential functional of simple, symmetric random walks with negative
drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent
and identically distributed non-negative random variables. It has moments that are
rational functions of the variables μ
k
= E(ξ
k
) < 1 with universal coefficients. It
turns out that such a coefficient is equal to the number of permutations with descent
set defined by the multiindex of the coefficient. A recursion enumerates all numbers
of permutations with given descent sets in the form of a Pascal-type triangle.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
2.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
3.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
4.
We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity. 相似文献
5.
6.
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
7.
《Discrete Mathematics》2022,345(3):112739
A ballot permutation is a permutation π such that in any prefix of π the descent number is not more than the ascent number. By using a reversal-concatenation map, we (i) give a formula for the joint distribution (pk, des) of the peak and descent statistics over ballot permutations, (ii) connect this distribution and the joint distribution (pk, des) over ordinary permutations in terms of generating functions, and (iii) confirm Spiro's conjecture which finds the equidistribution of the descent statistic for ballot permutations and an analogue of the descent statistic for odd order permutations. 相似文献
8.
9.
Ariane Carrance 《Random Structures and Algorithms》2019,55(3):615-648
We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞. 相似文献
10.
On the distribution of the length of the longest increasing subsequence of random permutations 总被引:18,自引:0,他引:18
Jinho Baik Percy Deift Kurt Johansson 《Journal of the American Mathematical Society》1999,12(4):1119-1178
The authors consider the length, , of the longest increasing subsequence of a random permutation of numbers. The main result in this paper is a proof that the distribution function for , suitably centered and scaled, converges to the Tracy-Widom distribution of the largest eigenvalue of a random GUE matrix. The authors also prove convergence of moments. The proof is based on the steepest descent method for Riemann-Hilbert problems, introduced by Deift and Zhou in 1993 in the context of integrable systems. The applicability of the Riemann-Hilbert technique depends, in turn, on the determinantal formula of Gessel for the Poissonization of the distribution function of .