一般集合上的两个函数和的图像的盒维数估计

本文研究了R1的非连通紧子集上的两个连续函数和的图像的盒维数估计的问题.利用构造反例的方法得到了与已有的结果完全不同的结论.通过引入适当的参量,进一步研究了Rn的非空有界子集上的两个函数和的图像的上、下盒维数估计,得到了其上、下界,并且构造了例子说明所得的上、下界能够达到.     

广义分数布朗运动的若干性质

本文, 我们定义了一类新的分数布朗运动, 研究了它的局部非决定性和局部时的联合连续性, 最后给出了它的水平集的Hausdorff维数的上、下界.     

广义α-Stable过程的像集和图集的一致维数

研究了未必具有随机一致Holder条件的N指标d维广义α-stable过程的像集和图集的一致维数问题,并在一定条件下得到了N指标d维广义α-stable过程像集约一致Hausdorff维数和一致Packing维数的上、下界,图集的一致Hausdorff维数和一致Packing维数的上界,包含了多指标α-stable过程和广义布朗单相应的结果．     

一类准自相似集的研究

本文引入并研究了准自相似集，利用动力系统技巧讨论了其Ｈａｕｓｄｏｒｆｆ维数的上、下界，得到了一类严格准自相似集的Ｈａｕｓｄｏｒｆｆ维数公式并确定了一类由共形映射族所确定的准自相似集的Ｈａｕｓｄｏｒｆｆ维数．     

有限域上一类等维码的下界

等维码凭借其在随机线性网络编码中的良好的差错控制得到广泛研究,对于给定维数和最小距离的等维码所含码字的最大个数目前还没有一般性结果.Tuvi Etzion和Alexander Vardy给出了一定等维码所含码字最大个数的上界和下界,首先利用对偶空间构造等维码C(n,M,2k,k),达到了此类码所含码字的下界,然后具体构造了最优等维码C(7,41,4,2).     

关于多项式小分数部分的一个注解

设f(x)为任意一实系数多项式,N.G.Moshchevitin在他的文章[8]中给出了集合{α∈R∶ limn→∞ infnlog n‖af(n)‖＞0}的Hausdorff维数的下界.在本文中,我们延用文[8]的方法并结合齐次Moran集的维数理论给出这个集合Hausdorff维数的精确值.     

多指标算子稳定Lévy过程象集与图集的豪斯多夫维数（英文）

本文获得多指标算子稳定Lévy过程象集与图集的下界豪斯多夫维数.这里的维数完全由指数矩阵所决定.     

若干周期再生核空间的覆盖数

借助离散Fourier变换给出估计Mercer核矩阵逆矩阵范数上界的一种方法,由此给出了估计周期再生核Hilbert空间覆盖数的上、下界的一般方法.特别, 对两种特殊的周期再生核空间覆盖数的上、下界进行了比较.     

关于一类Ornstein-Uhlenbeck型马氏过程Range的维数(英语)

本文我们考虑一类Ornstein-Uhlenbeck型马氏过程Range的分形性质,给出了它们的Hausdorff维数的上界和下界,此外在文末我们对这类过程的水平集的维数给出了估计。     

正则图的团横贯数的界

设D是图G的一个顶点子集, 若D含有G的每个团中至少一个顶点, 则D称为G的团横贯集. 图G的团横贯数是指它的最小团横贯集中顶点的数目, 记作τ_c(G). 本文研究正则图的团横贯数. 首先建立了正则图的团横贯数的上、下界, 且刻画了达到下界的极值图. 其次, 对无爪三次图, 得到了改进的可达上、下界并刻画了达到下界的极值图.     

Recursive lower and dual upper bounds for Bermudan-style options

Although Bermudan options are routinely priced by simulation and least-squares methods using lower and dual upper bounds, the latter are hardly optimized. In this paper, we optimize recursive upper bounds, which are more tractable than the original/nonrecursive ones, and derive two new results: (1) An upper bound based on (a martingale that depends on) stopping times is independent of the next-stage exercise decision and hence cannot be optimized. Instead, we optimize the recursive lower bound, and use its optimal recursive policy to evaluate the upper bound as well. (2) Less time-intensive upper bounds that are based on a continuation-value function only need this function in the continuation region, where this continuation value is less nonlinear and easier to fit (than in the entire support). In the numerical exercise, both upper bounds improve over state-of-the-art methods (including standard least-squares and pathwise optimization). Specifically, the very small gap between the lower and the upper bounds derived in (1) implies the recursive policy and the associated martingale are near optimal, so that these two specific lower/upper bounds are hard to improve, yet the upper bound is tighter than the lower bound.     

Differential Games of inf-sup Type and Isaacs Equations

Motivated by the work of Fleming, we provide a general framework to associate inf-sup type values with the Isaacs equations. We show that upper and lower bounds for the generators of inf-sup type are upper and lower Hamiltonians, respectively. In particular, the lower (resp. upper) bound corresponds to the progressive (resp. strictly progressive) strategy. By the Dynamic Programming Principle and identification of the generator, we can prove that the inf-sup type game is characterized as the unique viscosity solution of the Isaacs equation. We also discuss the Isaacs equation with a Hamiltonian of a convex combination between the lower and upper Hamiltonians.     

Lower Bounds for Transversal Covers

A transversal cover is a set of gk points in k disjoint groups of size g and a collection of b transversal subsets, called blocks, such that any pair of points not contained in the same group appears in at least one block. A central question is to determine, for given g, the minimum possible b for fixed k, or, alternatively, the maximum k for fixed b. The case g=2 was investigated and completely solved by Sperner sperner:28, Rényi renyi:71, Katona katona:73, and Kleitman and Spencer kleitman:73. For arbitrary g, asymptotic results are known but little is understood for small values of k. Constructions exist but these only produce upper bounds on b. The present article is concerned with lower bounds on b. We develop three general lower bounds on b for fixedg and k. The first one is proved using one of the principal constructions brett:97a, the second comes from the study of intersecting set-systems, and the third is shown by a set packing argument. In addition, we investigate upper bounds on k for small fixed b. This proves useful to reduce or eliminate the gap between lower and upper bounds on b for some transversal covers with small k.     

Some improvements for two-sided bounds on the inverse of diagonally dominant tridiagonal matrices

In this paper, we obtain lower and upper bounds for the entries of the inverses of diagonally dominant tridiagonal matrices. First of all we derive the bounds for off-diagonal elements of the inverse as a function of the diagonal ones, then we improve the two-sided bounds for the diagonal entries obtaining sharper lower and upper bounds for all the elements of the inverse.     

Energy of generalized line graphs

The energy of a graph is equal to the sum of the absolute values of its eigenvalues. Line graphs play an important role in the study of graph theory. Generalized line graphs extend the ideas of both line graphs and cocktail party graphs. In this paper, we establish relations between the energy of the generalized line graph of a graph G and the Laplacian and signless Laplacian energies of G. We give upper and lower bounds for the energy of generalized line graphs. Finally, we present upper and lower bounds for some special graphs.     

On the symmetric properties of APN functions

We study the symmetric properties of APN functions as well as the structure and properties of the range of an arbitrary APN function. We prove that there is no permutation of variables that preserves the values of an APN function. Upper bounds for the number of symmetric coordinate Boolean functions in an APN function and its coordinate functions invariant under a cyclic shift are obtained. For n ≤ 6, some upper bounds for the maximal number of identical values of an APN function are given and a lower bound is found for different values of an arbitrary APN function of n variables.     

Some New Bounds for Singular Values and Eigenvalues of Matrix Products

For two Hermitian matrices A and B, at least one of which is positive semidefinite, we give upper and lower bounds for each eigenvalue of AB in terms of the eigenvalues of A and B. For two complex matrices A,B with known singular values, upper and lower bounds are deduced for each singular value of AB.     

On the construction of minimizing sequences for convex functionals with upper and lower bounding functionals

A method is described for constructing upper and lower bounds for the stationary values of a general class of convex functionals. The method relies of the existence of approximating convex functionals whose Gâteaux derivatives are presumed to have simpler structure than the original. The method is iterative in that convergent sequences of bounds can be constructed. Some applications to the Laplacian operator are included.     

带策略约束的区间数双矩阵博弈的双线性规划求解方法

传统区间数双矩阵博弈理论研究局中人支付值为区间数的策略选择问题,但没有考虑局中人策略选择可能受到各种约束.创建一种求解局中人策略选择受约束且支付值为区间数的双矩阵博弈（简称带策略约束的区间数双矩阵博弈）的简单、有效的双线性规划求解方法.首先,将局中人的博弈支付看作支付值区间中数值的函数.通过证明这种函数具有单调性,据此利用支付值区间的上、下界,构造了一对辅助双线性规划模型,可分别用于显式地计算任意带策略约束的区间数双矩阵博弈中局中人区间数博弈支付的上、下界及其相应的最优策略.最后,利用考虑策略约束条件下企业和政府针对发展低碳经济策略问题的算例,通过比较其与不考虑策略约束情形下的结果,说明了提出的模型和方法的有效性、优越性及可应用性.     

Bounds for the singular values of a matrix involving its sparsity pattern

The paper presents new upper and lower bounds for the singular values of rectangularmatrices explicitly involving the matrix sparsity pattern. These bounds are based on an upper bound for the Perron root of a nonnegative matrix and on the sparsity-dependent version of the Ostrowski-Brauer theorem on eigenvalue inclusion regions. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 323, 2005, pp. 57–68.