Weierstrass-Mandelbrot函数的非单调类性

非单调类性质在连续函数研究中起着重要作用．众所周知，Weierstrass函数具有非单调类性质．本文证明了Weierstrass-Mandelbrot型函数具有非单调类性质．     

关于伽玛函数的单调性质

伽玛函数的单调性质和对数完全单调性质被获得了.     

一类K-单调系统产生的K-单调算子

本文研究了K-单调系统的解的渐近性质.应用K-单调算子的性质,得到了保证K-单调系统的正周期解的存在性、唯一性、全局渐近稳定性的充分条件.     

函数单词性的应用

学过函数的性质后,觉得单调性是函数的所有性质中,最为一般的一种性质．因为几乎所有的函数都有单调性可言,并且在解决诸如确定函数的单调区间、求函数值域、最大（小）值等数学问题时,可大显身手．有些表面上与函数的单调性关联不大数学问题,     

一类K-单调系统产生的K-单调算子

本文研究了Ｋ－单调系统的解的渐近性质．应用Ｋ－单调算子的性质,得到了保证Ｋ－单调系统的正周期解的存在性、唯一性、全局渐近稳定性的充分条件．     

T-单调映射及其性质

T-单调映射在变分不等式及非线性互补问题中经常遇到.此映射对应的非线性问题的解具有一些非常好的性质.这些性质在解的存在性证明,数值算法的构造及其收敛性分析中占有重要地位.本文系统讨论T-单调映射的性质,建立T-单调映射与常见的一些映射,如单调映射和Z-映射之间的联系.     

函数单调性的应用

学过函数的性质后,觉得单调性是函数的所有性质中,最为一般的一种性质.因为几乎所有的函数都有单调性可言,并且在解决诸如确定函数的单调区间、求函数值域、最大(小)值等数学问题时,可大显身手.有些表面上与函数的单调性关联不大数学问题,一旦我们把它们与函数的单调性联系起来,似乎对问题的理解就会变得容易起来,解题过程就将变得快捷起来.下面,把一些心得写在下面,以供同学们参考.     

一类含参数分数阶微分方程边值问题正解的性质研究

研究了一类含参数的分数阶微分方程边值问题,主要运用锥上的不动点定理及混合单调算子特征值问题的性质得出了正解关于参数的性质:存在唯一性、单调性、连续性以及极限性质.最后举例说明了结果的可行性.     

6 不等式

6.1 不等式的性质 内容概述 1.不等式的五条性质可简称为: (1)对称性; (2)传递性; (3)加法单调性;(4)乘法单调性; (5)正值开方性.     

两个非单调点PM函数的非单调高度

众所周知,单调函数的非单调高度都为0,而对于非单调的函数,情况将变得非常复杂.由于非单调高度的变化影响迭代根的构造,因此在动力系统的研究中具有重要的意义.将在之前N型PM函数的非单调高度研究的基础上,继续讨论两个非单调点PM函数的非单调高度分类,得到此类函数高度的完整分析,并以此研究其动力学性质.     

Population Monotonic Allocation Schemes in Bankruptcy Games

The USA Bankruptcy Code legislates the bankruptcy of firms. Any allocation mechanism that is legal according to the Bankruptcy Code is necessarily population monotonic. Bankruptcy rules yielding a population monotonic allocation scheme in the associated bankruptcy game are characterized by efficiency, reasonability (each claimant receives a nonnegative amount not exceeding his claim), and the thieve property. The thieve property for bankruptcy problems entails that if a claimant manages to escape with his claim, the amount allocated to each remaining claimant is not larger than his share in the original problem. Many bankruptcy rules studied in the literature are efficient, reasonable, self-consistent, and monotonic. Rules satisfying these axioms are shown to yield population monotonic allocation schemes.     

一类倒向随机微分方程L~p解对终值的单调连续性

在生成元g满足关于y单调且关于z Lipschitz连续的条件下,范(2007)得到了倒向随机微分方程L~p解对终值的单调连续结果.在g关于y单调且关于z一致连续的条件下证明了倒向随机微分方程L~p解的单调连续性,推广了范(2007)的工作,并且方法是新的.     

集合对策中值的标准性与分配方案的单调性

本文介绍了合作对策中一种新的类型一集合对策，讨论了集合对策中三种分配方案的性质，证明了边缘贡献值和联盟力量值具有二人分配的标准性与分配方案的单调性，而共享边缘贡献值仅具有分配方案的单调性．     

Tensor-product monotonicity preservation

This paper studies systems of tensor-product functions for which the functions they span are monotonic in any direction when their control nets are monotonic in that direction. It is shown that Bernstein polynomials and B-splines have this property but that totally positive systems in general, such as certain trigonometric and rational bases, do not. This revised version was published online in August 2006 with corrections to the Cover Date.     

Covering space for monotonic homotopy of trajectories of control systems

This paper considers monotonic (or causal) homotopy between trajectories of control systems. The main result is the construction of an analogue of the simply connected covering space. The constructed covering Γ(Σ,x) has the structure of a manifold and satisfies the property that two trajectories are monotonic homotopic if and only if the end points of their liftings coincide.     

Monotonic models and cycles

A partitional model of knowledge is monotonic if there exists a linear order on the state space such that, for every player, each element of her partition contains only a sequence of consecutive states. In monotonic models, the absence of alternating cycles is equivalent to the property that, for every pair of players, the join of their partitions contains only singletons. Under these equivalent conditions any set of posteriors for the players is consistent (i.e., there is a common prior). When checking for consistency in a monotonic model, it is not necessary to evaluate all cycle equations; if the cycle equations corresponding to cycles of length two hold, then there is a common prior.     

An energy-minimization framework for monotonic cubic spline interpolation

This paper describes the use of cubic splines for interpolating monotonic data sets. Interpolating cubic splines are popular for fitting data because they use low-order polynomials and have C² continuity, a property that permits them to satisfy a desirable smoothness constraint. Unfortunately, that same constraint often violates another desirable property: monotonicity. It is possible for a set of monotonically increasing (or decreasing) data points to yield a curve that is not monotonic, i.e., the spline may oscillate. In such cases, it is necessary to sacrifice some smoothness in order to preserve monotonicity.The goal of this work is to determine the smoothest possible curve that passes through its control points while simultaneously satisfying the monotonicity constraint. We first describe a set of conditions that form the basis of the monotonic cubic spline interpolation algorithm presented in this paper. The conditions are simplified and consolidated to yield a fast method for determining monotonicity. This result is applied within an energy minimization framework to yield linear and nonlinear optimization-based methods. We consider various energy measures for the optimization objective functions. Comparisons among the different techniques are given, and superior monotonic C² cubic spline interpolation results are presented. Extensions to shape preserving splines and data smoothing are described.     

An exterior point simplex algorithm for (general) linear programming problems

We present an exterior point simplex type algorithm that possesses a new monotonic property. A dual feasible basic solution is required to start with. Intermediate solutions are neither primal nor dual feasible. Cycling-free pivoting rules and an exponentional example are presented.     

Cores and large cores when population varies

In a TU cooperative game with populationN, a monotonic core allocation allocates each surplusv (S) among the agents of coalitionS in such a way that agenti's share never decreases when the coalition to which he belongs expands.We investigate the property of largeness (Sharkey [1982]) for monotonic cores. We show the following result. Given a convex TU game and an upper bound on each agent' share in each coalition containing him, if the upper bound depends only upon the size of the coalition and varies monotonically as the size increases, then there exists a monotonic core allocation meeting this system of upper bounds. We apply this result to the provision of a public good problem.     

Isotone cones in Banach spaces and applications to best approximations of operators without continuity conditions

In this paper, we introduce the concept of isotone cones in Banach spaces. Then, we apply the order monotonic property of the metric projection operator to prove the existence of best approximations for some operators without continuity conditions in partially ordered Banach spaces.