The t-coefficient method II: A new series expansion formula of theta function products and its implications

By means of Jacobi?s triple product identity and the t  -coefficient method, we establish a general series expansion formula with five free parameters for the product of arbitrary two Jacobi theta functions. It embodies the triple, quintuple, sextuple and septuple theta function product identities and the generalized Schröter formula. As further applications, we also set up a series expansion formula for the product of three theta functions. It not only generalizes Ewell?s and Chen–Chen–Huang?s octuple product identities, but also contains three cubic theta function identities due to Farkas–Kra and Ramanujan respectively and the Macdonald identity for the root system _A2$A_2$ as special cases. In the meantime, many other new identities including a new short expression of the triple theta series of Andrews are also presented.     

An integrated revenue sharing and quantity discounts contract for coordinating a supply chain dealing with short life-cycle products

This paper develops a combined contract model for coordinating a two stage supply chain where the demand at the retailer’s end is price sensitive and stock dependent. It has been shown that proposed coordination mechanism achieves perfect coordination and win–win situation for both the members of the supply chain. Further, an extensive sensitivity analysis is performed to examine the impact of various parameters on supply chain performance. It has been found that stock dependency factor has positive impact on order quantity and subsequently on supply chain performance. The paper has also made a comparative statics analysis to see the impact of certain parameters on the pricing and replenishment policies of the retailer.     

非对称需求扰动信息下的供应链显示机制设计

研究由一个供应商和一个零售商组成的供应链在非对称的需求扰动信息下的显示机制设计问题。假定市场需求为指数函数形式和常数柔性需求函数形式,给出了非对称的需求扰动信息下的供应链最优契约,并且分析了非对称扰动信息对于供应链性能的影响。研究表明,当市场需求为指数函数形式和常数柔性函数形式时,仍然可以设计有效的契约菜单来改善供应链的运作性能;当需求扰动满足一定条件时,初始的生产计划仍然是最优的;非对称需求扰动信息并不必然会给供应链带来利润损失,并且显式地给出了非对称的需求扰动信息不会给供应链带来利润损失的条件。     

Joins of 1-planar graphs

A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once.In this paper,we study 1-planar graph joins.We prove that the join G + H is 1-planar if and only if the pair [G,H] is subgraph-majorized by one of pairs [C3 ∪ C3,C3],[C4,C4],[C4,C3],[K2,1,1,P3] in the case when both elements of the graph join have at least three vertices.If one element has at most two vertices,then we give several necessary/sufficient conditions for the bigger element.     

Similarity degrees for the crossed product of von Neumann algebras

In this paper, we will estimate an upper bound for the similarity degree of the crossed product of a hyperfinite finite von Neumann algebra by weakly compact action of an infinite discrete group. We will also improve some upper bounds for similarity degrees of some finite von Neumann algebras.     

关于“一致有界的一族无穷小的积是无穷小”定理

针对微积分教材关于"无穷小的积是否是无穷小"的命题的模糊叙述,证明"一致有界的一族无穷小的积仍是无穷小".     

Subordination Results for p-Valent Meromorphic Functions Associated with a Linear Operator

In this paper, by making use of the Hadamard products, we obtain some subordination results for certain family of meromorphic functions defined by using a new linear operator.     

嫦娥三号软着陆轨道设计与控制策略的优化模型

针对嫦娥三号软着陆轨道设计与控制策略问题,在合理假设的前提下,建立动力学模型,求解得到了嫦娥三号着陆准备轨道近月点和远月点的速度。针对软着陆过程的6个阶段,通过受力分析,建立了嫦娥三号运动的微分方程模型,以燃料消耗最小为优化目标,以每个阶段的起止状态为约束条件,将软着陆轨道的优化设计问题转化为主发动机推力的泛函极值问题,并将其控制函数转化为近似的多项式函数优化问题。运用四阶Runge-Kutta差分迭代方法进行求解计算,从而得到各个阶段的最优控制函数和控制策略。结果表明,嫦娥三号软着陆过程耗时695s,消耗燃料1 269.1kg。     

B(H)上保算子*乘积κ-幂零性的映射

将B(H)上保算子幂零性映射的研究由有限维推广到无限维,主要给出维数大于等于3的实或复的Hilbert空间算子代数上保算子*乘积k-幂零性映射的刻画.     

两类四阶微分算子积的自伴性研究

利用算子理论及矩阵运算方法,讨论了由两类不同的对称微分算式D~((4))+D~((2))+q_1(t)和D~((4))+q_2(t)(D=d/dt,t∈I=[a,b])生成的微分算子的积算子的自伴性,获得了积算子是自伴算子的充分必要条件.