搜索结果: 1-15 共查到“理学 Upper bounds”相关记录18条 . 查询时间(0.058 秒)
Upper bounds on algebraic connectivity via convex optimization
Laplace operator matrix algebra connection Laplacian invariant subset matrix convex function
2015/8/10
The second smallest eigenvalue of the Laplacian matrix L of a graph is called its algebraic connectivity. We describe a method for obtaining an upper bound on the algebraic connectivity of a family of...
Euler's Partition Theorem with Upper Bounds on Multiplicities
partition Euler's partition theorem Sylvester's bijection
2014/6/3
We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m + 1 equals the number of partitions of n with k odd parts such that the multi...
Exponential and non-exponential upper bounds for the ruin probabilities for the double Cox processes risk models
Probability Double Cox processes Martingale method
2011/11/4
In this paper, we consider a general insurance risk model in which the premium income process and the claim process are based on Cox processes. Exponential upper bounds for ruin probabilities are obta...
Upper bounds for the maximum of a random walk with negative drift
Limit theorems random walks renewal theorem
2011/9/21
Abstract: Consider a random walk $S_n=\sum_{i=0}^n X_i$ with negative drift. This paper deals with upper bounds for the maximum $M=\max_{n\ge 1}S_n$ of this random walk in different settings of power ...
Upper Bounds for Markov Approximations of Ergodic Processes
Chains of infinite order coupling from the past algorithms canonical Markov approximation d-distance Kullback-Leibler divergence
2011/9/19
Abstract: Chains of infinite order are generalizations of Markov chains that constitute a flexible class of models in the general theory of stochastic processes. These processes can be naturally studi...
Abstract: In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n ...
Upper Bounds for the Number of Number Fields with Alternating Galois Group
Number Fields Alternating Galois Group Number Theory
2011/8/26
Abstract: We study the number $N(n, A_n, X)$ of number fields of degree $n$ whose Galois closure has Galois group $A_n$ and whose discriminant is bounded by $X$. By a conjecture of Malle, we expect th...
Upper bounds for the bondage number of graphs on topological surfaces
Bondage number Domination number Topological surface
2011/2/22
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having...
Upper bounds for the number of zeroes for some Abelian integrals
Abelian integrals Weak 16th Hilbert’s Problem limit cycles
2011/2/25
Consider the vector field x′ = −yG(x, y), y′ = xG(x, y), where the set of critical points {G(x, y) = 0} is formed by K straight lines, not passing through the origin and parallel to one or two o...
Lower and upper bounds for nef cones
nef cones
2010/11/26
The nef cone of a projective variety Y is an important and often elusive invariant. In this paper we construct two polyhedral lower bounds and one polyhedral upper bound for the nef cone of Y using an...
Upper bounds for the secure key rate of decoy state quantum key distribution
Upper bounds secure key decoy state quantum key
2010/4/12
The use of decoy states in quantum key distribution (QKD) has provided a method for substantially increasing the secret key rate and distance that can be covered by QKD protocols with practical signal...
Explicit Upper Bounds for the Average Order of $d_n$ and Applications to Class Number
Multiplicative number theory Average order Class number
2008/7/3
In this paper, we prove some explicit upper bounds for the average order of the generalized divisor function, and, according to an idea of Lenstra, we use them to obtain bounds for the class number of...
A Note on the Upper Bounds for the Dispersion.
Good Lower and Upper Bounds on Binomial Coefficients
Binomial Coefficients Stirling's Formula Inequalities
2008/7/1
We provide good bounds on binomial coefficients, generalizing known ones, using some results of H. Robbins and of Sasvári.
Some p.d.f.-free Upper Bounds for the Dispersion $\sigma(X)$ and the Quantity $\sigma^{2}(X)+(x-EX) ^{2}$
Quantity Dispersion p.d.f.-free Upper Bounds
2008/6/26
Some p.d.f.-free Upper Bounds for the Dispersion $\sigma(X)$ and the Quantity $\sigma^{2}(X)+(x-EX) ^{2}$.