期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
最简句法中的层阶性及其理论局限性 被引量:9
1
作者 傅玉 《外语教学》 CSSCI 北大核心 2007年第4期24-28,共5页
最简方案作为一个推导性的理论在很多方面都体现了层阶性。本文以乔姆斯基关于最简方案的近期论著为基础,从三个方面分析和探讨了最简句法的层阶性,包括它的句法应用以及它的理论局限性,并尝试对一些相关问题提出解决方案。
关键词 最简方案 层阶性 数量系列 拼读
下载PDF
Wronskian and Grammian Determinant Solutions for a Variable-Coefficient Kadomtsev-Petviashvili Equation 被引量:2
2
作者 YAO Zhen-Zhi ZHANG Chun-Yi +4 位作者 ZHU Hong-Wu MENG Xiang-Hua LU Xing SHAN Wen-Rui TIAN Bo 《Communications in Theoretical Physics》 SCIE CAS CSCD 2008年第5期1125-1128,共4页
In this paper, we derive the bilinear form for a variable-coefficient Kadomtsev Petviashvili-typed equation. Based on the bilinear form, we obtain the Wronskian determinant solution, which is proved to be indeed an ex... In this paper, we derive the bilinear form for a variable-coefficient Kadomtsev Petviashvili-typed equation. Based on the bilinear form, we obtain the Wronskian determinant solution, which is proved to be indeed an exact solution of this equation through the Wronskian technique. In addition, we testify that this equation can be reduced to a Jacobi identity by considering its solution as a Grammian determinant by means of Pfaffian derivative formulae. 展开更多
关键词 variable-coefficient Kadomtsev-Petviashvili equation Wronskian determinant Grammian deter-minant PFAFFIAN Jacobi identity
下载PDF
Two Kinds of Series Involving the Reciprocals of Binomial Coefficients
3
作者 SONG Hai-tao 《Chinese Quarterly Journal of Mathematics》 CSCD 2011年第2期306-310,共5页
By applying the theory of formal power series,the author obtains the closed forms for two kinds of infinite series involving the reciprocals of binomial coefficients,and the author gets another closed form for the inf... By applying the theory of formal power series,the author obtains the closed forms for two kinds of infinite series involving the reciprocals of binomial coefficients,and the author gets another closed form for the infinite series Σr≥m tn+r/(n+rr). 展开更多
关键词 reciprocals of binomial coefficients formal power series combinatorial identity
下载PDF
The Coefficient Invariant and Linking Number of Link with Two Components
4
作者 Huaan Wu 《Journal of Systems Science and Information》 2006年第3期543-546,共4页
If L is a link with two components and S1,S2…, Sn a switching sequence such that SnSn-1…S1L is unlinked, it is proved that lk(L) =∑i=1^nεi(L) and any link L can be transformed a n-twisting L~ by switching s... If L is a link with two components and S1,S2…, Sn a switching sequence such that SnSn-1…S1L is unlinked, it is proved that lk(L) =∑i=1^nεi(L) and any link L can be transformed a n-twisting L~ by switching some crossings with the linking number:lk(L)=∑i=1^mεiC(EiL)+n 展开更多
关键词 LINK switching sequence link number
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部