In this paper, we made a new breakthrough, which proposes a new recursion–transform(RT) method with potential parameters to evaluate the nodal potential in arbitrary resistor networks. For the first time, we found ...In this paper, we made a new breakthrough, which proposes a new recursion–transform(RT) method with potential parameters to evaluate the nodal potential in arbitrary resistor networks. For the first time, we found the exact potential formulae of arbitrary m × n cobweb and fan networks by the RT method, and the potential formulae of infinite and semi-infinite networks are derived. As applications, a series of interesting corollaries of potential formulae are given by using the general formula, the equivalent resistance formula is deduced by using the potential formula, and we find a new trigonometric identity by comparing two equivalence results with different forms.展开更多
In this article, we study the Lax pairs of -dimensional equation: the modified generalized dispersive long wave (MGDLW) equation. Based on the well-known binary Darboux transformation, we dig out the recursion formula...In this article, we study the Lax pairs of -dimensional equation: the modified generalized dispersive long wave (MGDLW) equation. Based on the well-known binary Darboux transformation, we dig out the recursion formulas of the first part of the Lax pairs. Then by further discussion and doing some revisional work, we make the recursion formulas fit for the second part of Lax pairs. At last, some solutions to the MGDLW equation are worked out by using the recursion formula.展开更多
Though the Bǎcklund transformation on time-like surfaces with constant mean curvature surfaces in R^2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related ...Though the Bǎcklund transformation on time-like surfaces with constant mean curvature surfaces in R^2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related integrable system cannot be avoided when the Bǎcklund transformation is used, For sake of this, in this article, some special work is done to reform the Bǎcklund transformation to a recursion formula, by which we can construct time-like surfaces with constant mean curvature form known ones just by quadrature procedure.展开更多
A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also ...A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.展开更多
In this paper, we present some polynomial identities of Hurwitz-Hodge integral. Subsequently, we present how to obtain some Hurwitz-Hodge integral identities from the polynomial identity. Lastly, we give a recursion f...In this paper, we present some polynomial identities of Hurwitz-Hodge integral. Subsequently, we present how to obtain some Hurwitz-Hodge integral identities from the polynomial identity. Lastly, we give a recursion formula for Hurwitz-Hodge integral (TbL λgλ1)ag.展开更多
Several(generalized)hypergeometric functions and a variety of their extensions have been presented and investigated in the literature by many authors.In the present paper,we investigate four new hypergeometric functio...Several(generalized)hypergeometric functions and a variety of their extensions have been presented and investigated in the literature by many authors.In the present paper,we investigate four new hypergeometric functions in four variables and then establish several recursion formulas for these new functions.Also,some interesting particular cases and consequences of our results are discussed.展开更多
We deal with the (2 + 1)-extension of classical Boussinesq system,which can reduce to several meaningful(1 + 1)-dimensional systems.By studying its Lax pair,we put forward invariances of Lax pair at first,then a recur...We deal with the (2 + 1)-extension of classical Boussinesq system,which can reduce to several meaningful(1 + 1)-dimensional systems.By studying its Lax pair,we put forward invariances of Lax pair at first,then a recursionformula depending on an arbitrary function is derived.At last,some solutions of the (2 + 1)-extension of classicalBoussinesq system are digged out by using the formula.展开更多
A recursive method based on successive computations of perimeters of inscribed regular polygons for estimating π is formulated by employing the Pythagorean theorem alone without resorting to any trigonometric calcula...A recursive method based on successive computations of perimeters of inscribed regular polygons for estimating π is formulated by employing the Pythagorean theorem alone without resorting to any trigonometric calculations. The approach is classical but the formulation of coupled recursion relations is new. Further, use of infinite series for computing π is explored by an improved version of Leibniz’s series expansion. Finally, some remarks with reference to π are made on a relatively recently rediscovered Sumerian tablet depicting geometric figures.展开更多
The problem of evaluating an infinite series whose successive terms are reciprocal squares of the natural numbers was posed without a solution being offered in the middle of the seventeenth century. In the modern era,...The problem of evaluating an infinite series whose successive terms are reciprocal squares of the natural numbers was posed without a solution being offered in the middle of the seventeenth century. In the modern era, it is part of the theory of the Riemann zeta-function, specifically ζ (2). Jakob Bernoulli attempted to solve it by considering other more tractable series which were superficially similar and which he hoped could be algebraically manipulated to yield a solution to the difficult series. This approach was eventually unsuccessful, however, Bernoulli did produce an early monograph on summation of series. It remained for Bernoulli’s student and countryman Leonhard Euler to ultimately determine the sum to be . We characterize a class of series based on generalizing Bernoulli’s original work by adding two additional parameters to the summations. We also develop a recursion formula that allows summation of any member of the class.展开更多
The AFLT states|PY1,Y2has reflection symmetry,Sn|PY1,Y2=|PY2,Y2,nb=2P,where S is the screening charge.AFLT state can be constructed using this reflect symmetry.We propose a recursion formula for this construction.The ...The AFLT states|PY1,Y2has reflection symmetry,Sn|PY1,Y2=|PY2,Y2,nb=2P,where S is the screening charge.AFLT state can be constructed using this reflect symmetry.We propose a recursion formula for this construction.The recursion formula is factorized completely.展开更多
G(p)和G(p→F(q))是有界模型检测(bounded model checking,简称BMC)中的两个重要的常用模态算子.对验证G(p)和G(p→F(q))编码转换公式进行优化.通过分析当验证这些模态算子时FSM(finite state machine)的状态转移和线性时序逻辑(linear-...G(p)和G(p→F(q))是有界模型检测(bounded model checking,简称BMC)中的两个重要的常用模态算子.对验证G(p)和G(p→F(q))编码转换公式进行优化.通过分析当验证这些模态算子时FSM(finite state machine)的状态转移和线性时序逻辑(linear-time temporal logic,简称LTL)的语义特征.在现有的编码公式的基础上,给出了简洁、高效的递推公式,该公式有利于高效编码成SAT(satisfiability)实例;证明了递推公式和原转换公式的逻辑关系.通过实验比较分析,在生成SAT实例规模和易求解方面都优于BMC中求解这些模态算子的现有的两种重要方法AA_BMC和Timo_BMC.所给出的方法和思想对于BMC中验证其他模态算子时的编码优化也有参考价值.展开更多
基金Project supported by the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20161278)
文摘In this paper, we made a new breakthrough, which proposes a new recursion–transform(RT) method with potential parameters to evaluate the nodal potential in arbitrary resistor networks. For the first time, we found the exact potential formulae of arbitrary m × n cobweb and fan networks by the RT method, and the potential formulae of infinite and semi-infinite networks are derived. As applications, a series of interesting corollaries of potential formulae are given by using the general formula, the equivalent resistance formula is deduced by using the potential formula, and we find a new trigonometric identity by comparing two equivalence results with different forms.
基金The project supported by National Natural Science Foundation of China under Grant No.10101025
文摘In this article, we study the Lax pairs of -dimensional equation: the modified generalized dispersive long wave (MGDLW) equation. Based on the well-known binary Darboux transformation, we dig out the recursion formulas of the first part of the Lax pairs. Then by further discussion and doing some revisional work, we make the recursion formulas fit for the second part of Lax pairs. At last, some solutions to the MGDLW equation are worked out by using the recursion formula.
基金The project supported by National Natural Science Foundation of China under Grant Nos. 10571149, 10571165, and 10101025 We are grateful to Sha Nan-Shi and Zhang Wen-Jing, who are both students in Department of Statistics and Finance, University of Science and Technology of China, for their valuable and creative ideas in stimulating discussions as well as conscientious work of computing.
文摘Though the Bǎcklund transformation on time-like surfaces with constant mean curvature surfaces in R^2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related integrable system cannot be avoided when the Bǎcklund transformation is used, For sake of this, in this article, some special work is done to reform the Bǎcklund transformation to a recursion formula, by which we can construct time-like surfaces with constant mean curvature form known ones just by quadrature procedure.
基金This research is partially supported by NNSF of China.
文摘A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.
文摘In this paper, we present some polynomial identities of Hurwitz-Hodge integral. Subsequently, we present how to obtain some Hurwitz-Hodge integral identities from the polynomial identity. Lastly, we give a recursion formula for Hurwitz-Hodge integral (TbL λgλ1)ag.
文摘Several(generalized)hypergeometric functions and a variety of their extensions have been presented and investigated in the literature by many authors.In the present paper,we investigate four new hypergeometric functions in four variables and then establish several recursion formulas for these new functions.Also,some interesting particular cases and consequences of our results are discussed.
文摘We deal with the (2 + 1)-extension of classical Boussinesq system,which can reduce to several meaningful(1 + 1)-dimensional systems.By studying its Lax pair,we put forward invariances of Lax pair at first,then a recursionformula depending on an arbitrary function is derived.At last,some solutions of the (2 + 1)-extension of classicalBoussinesq system are digged out by using the formula.
文摘A recursive method based on successive computations of perimeters of inscribed regular polygons for estimating π is formulated by employing the Pythagorean theorem alone without resorting to any trigonometric calculations. The approach is classical but the formulation of coupled recursion relations is new. Further, use of infinite series for computing π is explored by an improved version of Leibniz’s series expansion. Finally, some remarks with reference to π are made on a relatively recently rediscovered Sumerian tablet depicting geometric figures.
文摘The problem of evaluating an infinite series whose successive terms are reciprocal squares of the natural numbers was posed without a solution being offered in the middle of the seventeenth century. In the modern era, it is part of the theory of the Riemann zeta-function, specifically ζ (2). Jakob Bernoulli attempted to solve it by considering other more tractable series which were superficially similar and which he hoped could be algebraically manipulated to yield a solution to the difficult series. This approach was eventually unsuccessful, however, Bernoulli did produce an early monograph on summation of series. It remained for Bernoulli’s student and countryman Leonhard Euler to ultimately determine the sum to be . We characterize a class of series based on generalizing Bernoulli’s original work by adding two additional parameters to the summations. We also develop a recursion formula that allows summation of any member of the class.
基金Supported by Program "Frontier Topics in Mathematical Physics"(KJCX3-SYW-S03)National Natural Science Foundation of China under Grant No.11035008
文摘The AFLT states|PY1,Y2has reflection symmetry,Sn|PY1,Y2=|PY2,Y2,nb=2P,where S is the screening charge.AFLT state can be constructed using this reflect symmetry.We propose a recursion formula for this construction.The recursion formula is factorized completely.
文摘G(p)和G(p→F(q))是有界模型检测(bounded model checking,简称BMC)中的两个重要的常用模态算子.对验证G(p)和G(p→F(q))编码转换公式进行优化.通过分析当验证这些模态算子时FSM(finite state machine)的状态转移和线性时序逻辑(linear-time temporal logic,简称LTL)的语义特征.在现有的编码公式的基础上,给出了简洁、高效的递推公式,该公式有利于高效编码成SAT(satisfiability)实例;证明了递推公式和原转换公式的逻辑关系.通过实验比较分析,在生成SAT实例规模和易求解方面都优于BMC中求解这些模态算子的现有的两种重要方法AA_BMC和Timo_BMC.所给出的方法和思想对于BMC中验证其他模态算子时的编码优化也有参考价值.