共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
3.
本文根据Schwick的思想,利用Zalcman引理讨论了随机迭代函数族动力系统,指出了函数族随机迭代动力系统的Fatou集和函数族衍生半群动力系统的Fatou集定义差别明显但却等价.并获得了如下正规定则,设F={fi|fi为C(C)上的非线性解析函数,i ∈ M},其中M为非空指标集,ΣM={(j1,j2,…,jn,…)|ji ∈ M,i ∈ N},若对任意的指标序列σ=(j1,j2,…,jn,…)∈ ΣM,迭代序列{Wσn=fjn º fjn-1 º … ºfj1(z)|n ∈ N}在点z处正规,则函数族F本身在点z处正规. 相似文献
4.
本文通过L-函数的整体积分幂矩,来推导某些自守L-函数集合的整体零点密度的上界估计.具体而言,假设I是某些自守表示π构成的集合,对任意π有非负系数c(π)且级数∑π∈I c(π)收敛.假设■其中l≥1,0 <α≤1,θ≥α.则可以得到整体零点密度■的上界估计,这里Nπ(σ,T1,T2)表示满足σ<β<1及T1≤γ≤T2的L(s,π)的零点ρ=β+iγ的个数. 相似文献
5.
在拓扑向量空间中研究DICR函数.引入该函数关于支撑集、次微分的概念,研究该函数支撑集、次微分之间的关系.也研究了与严格DICR函数相关的集合的最大元,得到严格DICR函数差的全局最小值的充要条件. 相似文献
6.
给出Nevanlinna不等式的余项S(r,{aj},f)的一个上界估计 .对于给定的满足∫∞1dr/p(r) =∫∞1dr/(r(r) ) =∞的正的增函数p和 ,令 Ψ(r) =∫r1dt/(t(t) ) ,P(r) =∫r1dt/p(t) ,证明了 S(r,{aj},f) ≤logT(r,f)(T(r,f) )p(r) +O( 1 )对扩充复平面上的任意有穷个点 {εj}和满足 Ψ(T(r,f) ) =O(P(r) )的任意亚纯函数f成立 ,至多除去一个r的小例外集 .这个估计改进了已有的结果 .讨论了这个估计的精确性 . 相似文献
7.
非可微二层凸规划的最优性条件 总被引:3,自引:0,他引:3
本文考虑的是构成函数为非可微凸函数的二层规划问题(NDBP),得到了下层极值函数和上层复合目标函数的方向导数和次微分的估计式,给出非可微二层凸规划(NDBP)最优解的几种最优性条件。 相似文献
8.
9.
10.
本文对构成函数为Lipschitz函数的二层规划问题,利用非光滑分析工具,讨论了下层极值函数和上层复合目标函数的Lipschitz连续性,给出了这些函数的广义微分和广义方向导数的估计式。本文得到的结果为进一步研究非可微二层Lipschitz规划的最优性条件和有效算法等理论和方法问题奠定了基础。 相似文献
11.
By characterizing Asplund operators through Fréchet differentiability property of convex functions, we show the following Bishop–Phelps–Bollobás theorem: Suppose that X is a Banach space,T : X → C(K) is an Asplund operator with ║T║= 1, and that x_0 ∈ S_X, 0 ε satisfy ║T(x_0)║ 1-ε~2/2.Then there exist x_ε∈ S_X and an Asplund operator S : X → C(K) of norm one so that ║S(x_ε)║ = 1, x_0-x_ε ε and ║T-S║ ε.Making use of this theorem, we further show a dual version of Bishop–Phelps–Bollobás property for a strong Radon–Nikodym operator T : ?_1 → Y of norm one: Suppose that y_0~*∈ S_(Y~*), ε≥ 0 satisfy T~*(y_0~*) 1-ε~2/2. Then there exist y_ε~*∈ S_(Y~*), x_ε∈(±e_n), y_ε∈ S_Y, and a strong Radon–Nikodym operator S : ?_1 → Y of norm one so that (ⅰ)║S(x_ε)║= 1;(ⅱ) S(x_ε) = y_ε;(ⅲ)║T-S║ ε;(ⅳ)║S~*(y_ε~*)║=y_ε~*, y_ε= 1;(ⅴ)║y_0~*-y_ε~*║ ε and (ⅵ)║T~*-S~*║ ε,where(e_n) denotes the standard unit vector basis of ?_1. 相似文献
12.
Eunjeong Yi 《数学学报(英文版)》2015,31(3):367-382
Let G =(V(G), E(G)) be a graph with vertex set V(G) and edge set E(G). For two distinct vertices x and y of a graph G, let RG{x, y} denote the set of vertices z such that the distance from x to z is not equa l to the distance from y to z in G. For a function g defined on V(G) and for U■V(G), let g(U) =∑s∈Ug(s). A real-valued function g : V(G) → [0, 1] is a resolving function of G if g(RG{x, y}) ≥ 1 for any two distinct vertices x, y ∈ V(G). The fractional metric dimension dimf(G)of a graph G is min{g(V(G)) : g is a resolving function of G}. Let G1 and G2 be disjoint copies of a graph G, and let σ : V(G1) → V(G2) be a bijection. Then, a permutation graph Gσ =(V, E) has the vertex set V = V(G1) ∪ V(G2) and the edge set E = E(G1) ∪ E(G2) ∪ {uv | v = σ(u)}. First,we determine dimf(T) for any tree T. We show that 1 dimf(Gσ) ≤1/2(|V(G)| + |S(G)|) for any connected graph G of order at least 3, where S(G) denotes the set of support vertices of G. We also show that, for any ε 0, there exists a permutation graph Gσ such that dimf(Gσ)- 1 ε. We give examples showing that neither is there a function h1 such that dimf(G) h1(dimf(Gσ)) for all pairs(G, σ), nor is there a function h2 such that h2(dimf(G)) dimf(Gσ) for all pairs(G, σ). Furthermore,we investigate dimf(Gσ) when G is a complete k-partite graph or a cycle. 相似文献
13.
考虑如下广义线性模型y_i=h(x~T_i,β)+e_i=1,2,…,n,其中e_i=G(…,ε_(i-1),ε_i),h是一个连续可导函数,ε_i是独立同分布的随机变量,并且它的期望为0,方差σ~2有限.本文给出了参数β的M估计,并且得到了该估计的Bahadur表示,该结论推广了线性模型的相关结论.应用M估计的Bahadur表示,得到了相依误差的线性回归模型,poisson模型,logistic模型和独立误差的广义线性模型等模型的渐近性质. 相似文献
14.
In a normed vector space, we study the minimal time function determined by a moving target set and a differential inclusion, where the set-valued mapping involved has constant values of a bounded closed convex set U. After establishing a characterization of ?-subdifferential of the minimal time function, we obtain that the limiting subdifferential of the minimal time function is representable by virtue of the corresponding normal cones of sublevel sets of the function and level or sublevel sets of the support function of U. The known results require the set U to have the origin as an interior point and the target set is a fixed set. 相似文献
15.
Parameter Estimation for the Discretely Observed Vasicek Model with Small Fractional Lévy Noise 下载免费PDF全文
The statistical inference of the Vasicek model driven by small Levy process has a long history.In this paper,we consider the problem of parameter estimation for Vasicek model dX_t=(μ-θX_t)dt+εdL_t^d,t∈[0,1],X_0=x_0,driven by small fractional Lévy noise with the known parameter d less than one half,based on discrete high-frequency observations at regularly spaced time points{t_i=i/n,i=1,2,...,n}.For the general case and the null recurrent case,the consistency as well as the asymptotic behavior of least squares estimation of unknown parametersμandθhave been established as small dispersion coefficientε→0 and large sample size n→∞simultaneously. 相似文献
16.
Let f be a transcendental entire function with order ρ 12and let σ be a sufficiently large constant. We prove that if there exists r0 1 such that, for all r r0 and any small ε 0,M(rσ, f) ≥ M(r, f)σ+ε,then every component of the Fatou set F(f) is bounded. 相似文献
17.
The first and second Zagreb eccentricity indices of graph G are defined as:E1(G)=∑(vi)∈V(G)εG(vi)~2,E2(G)=∑(vivj)∈E(G)εG(vi)εG(vj)whereεG(vi)denotes the eccentricity of vertex vi in G.The eccentric complexity C(ec)(G)of G is the number of different eccentricities of vertices in G.In this paper we present some results on the comparison between E1(G)/n and E2(G)/m for any connected graphs G of order n with m edges,including general graphs and the graphs with given C(ec).Moreover,a Nordhaus-Gaddum type result C(ec)(G)+C(ec)(■)is determined with extremal graphs at which the upper and lower bounds are attained respectively. 相似文献
18.
In this paper we approach the study of the subdifferential of the closed convex hull of a function and the related integration problem without the usual assumption of epi-pointedness. The key tool is, as in Hiriart-Urruty et al. (2011) [7], the concept of ε-subdifferential. Some other assumptions which are standard in the literature are also removed. 相似文献
19.
For a closed set S and a bounded closed convex set U in a real normed vector space, we give exact subdifferential formulas of an optimal value function \(\mathrm {I}\!\Gamma _{S|U}\) whose definition is based on the Minkowski function of U. \(\mathrm {I}\!\Gamma _{S|U}\) covers distance function and indicator function as special cases. The main contribution is dropping two important assumptions of some main results in the literature. 相似文献