q-微分算子的一个恒等式及其应用

应用q-微分算子Leibniz公式，证明了q-微分算子的一个恒等式，并应用此恒等式导出了著名的Sears变换及Al－Salam－Carlitz正交关系等重要结论，还得到了Askey－Roy积分的一个拓广     

Nassrallah-Rahman积分的一个新证明

应用关于ｑ－微分算子的Ｌｅｉｂｎｉｚ公式证明了关于ｑ－微分算子的两个恒等式．利用这些恒等式及ｑ－级数的一些求和公式给出了Ｎａｓｒａｌａｈ－Ｒａｈｍａｎ积分的一个新证明，进而给出了关于ｑ－级数８Φ７的积分表示的一个简易推导     

与Faa di Bruno公式相关的一些奇异恒等式

文[1]用Faa di Bruno公式找到了一些关于分拆集上求和奇异的恒等式,本文利用类似的方法找到了另外的一些奇异恒等式,并且利用Lagrange公演公式得到一个论。     

几个基本超几何级数公式

本文用 Bailey的变换公式和 Ismail等人的恒等式给出了一个新的 q-级数恒等式 .给出了这种方法的新的应用     

q-超球多项式与若干Rogers-Ramanujan型恒等式

利用ｑ－超球多项式的两个简单性质,建立了关于ｑ－级数的两个变换公式,借助这些变换公式并结合著名的Ｒｏｇｅｒｓ－Ｒａｍａｎｕｊａｎ恒等式,给出了若干Ｒｏｇｅｒｓ－Ｒａｍａｎｕｊａｎ型恒等式的简洁证明。     

从子阵表达式到Binet-Cauchy公式推广

基于对矩阵子阵及矩阵积的子阵表达式的讨论,将著名的Binet-Cauchy公式推广到了一般情况,并由此得到一个四次恒等式,该恒等式亦是著名的Lagrange恒等式和Cauchy不等式的一个推广.     

关于酉代数的几个公式

讨论复数域的子域上具有内积的代数，得出几个恒等式及一些代数联系公式。     

积分恒等式及其在无穷级数求和中的应用

借助L2[0,π]中标准正交基展开理论,得到积分恒等式,然后运用这个积分恒等式,通过定积分计算给出几个无穷级数和公式的简单证明,同时得到一些新的无穷级数和公式.     

一个恒等式

一个恒等式董凡平，武家华（山东工程学院）（合肥经济技术学院）在三角函数中有积化和差。今把ａｍｂｍ型的用△＝ａ２＋ａｂ＋ｂ２，δ＝ａｂ（ａ＋ｂ）２表示出来，获得一个很好的恒等式。由ａ３ｂ３＝δ２－ａ２ｂ２△，等等，我归纳出下述公式定理ｍ是正整数，公式证...     

En空间中张角定理及其应用

本文利用单形的体积公式,得到了n维欧氏空间En中的张角定理,由此又证得了单形中的一组恒等式,利用这组恒等式给出了Safta猜想在En空间中的加强形式.     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Box-Rectangular Drawings of Plane Graphs

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a linear-time algorithm to find a box-rectangular drawing of G if it exists.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

Mean-variance portfolio selection for a non-life insurance company

We consider a collective insurance risk model with a compound Cox claim process, in which the evolution of a claim intensity is described by a stochastic differential equation driven by a Brownian motion. The insurer operates in a financial market consisting of a risk-free asset with a constant force of interest and a risky asset which price is driven by a Lévy noise. We investigate two optimization problems. The first one is the classical mean-variance portfolio selection. In this case the efficient frontier is derived. The second optimization problem, except the mean-variance terminal objective, includes also a running cost penalizing deviations of the insurer’s wealth from a specified profit-solvency target which is a random process. In order to find optimal strategies we apply techniques from the stochastic control theory.     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

Two questions on semi-clean group rings

It was proved in [4] that every group ring of a torsion abelian group over a commutative local ring is a semi-clean ring. It was asked in [4] whether every group ring of a torsion abelian group over a commutative clean ring is a semi-clean ring and whether every group ring of a torsion abelian group over a commutative semi-clean ring is a semi-clean ring. In this paper, we give a positive answer to question 1 and a negative answer to question 2.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

The KdV soliton crosses a dissipative and dispersive border

We demonstrate the behavior of the soliton which, while moving in non-dissipative and dispersion-constant medium encounters a finite-width barrier with varying dissipation and/or dispersion; beyond the layer dispersion is constant (but not necessarily of the same value) and dissipation is null. The transmitted wave either retains the form of a soliton (though of different parameters) or scatters a into a number of them. And a reflection wave may be negligible or absent. This models a situation similar to a light passing from a humid air to a dry one through the vapor saturation/condensation area. Some rough estimations for a prediction of an output are given using the relative decay (or accumulation) of the KdV conserved quantities in a dissipative area; in particular for a restriction for a number of solitons in the transmitted signal.