理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 On upper bounds相关记录16条 . 查询时间(0.062 秒)
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...
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...
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...
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 ...
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 ...
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...
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...
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...
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.
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}$.
Predictor-corrector algorithm for linear programming, proposed by Mizuno et al.$^{[1]}$, becomes the best well known in the interior point methods. The purpose of this paper is to extend these resu...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...