欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
The q-WZ method for infinite series
ISSN号:0747-7171
期刊名称:Journal of Symbolic Computation
时间:0
页码:960-971
语言:英文
相关项目:图论
作者:
Chen, William Y. C.|Xia, Ernest X. W.|
同期刊论文项目
图论
期刊论文 35
同项目期刊论文
Maximum IPP codes of length 3
Approximating the chromatic index of multigraphs
Balanced judicious partitions of graphs
Long cycles in 4-connected planar graphs
Triangle-free subcubic graphs with minimum bipartite density
Hamilton circles in infinite planar graphs
Maximum bipartite subgraphs of cubic triangle-free planar graphs
Judicious k-partitions of graphs
ON A BIPARTITION PROBLEM OF BOLLOBAS AND SCOTT
THE REVERSE ULTRA LOG-CONCAVITY OF THE BOROS-MOLL POLYNOMIALS
THE RATIO MONOTONICITY OF THE BOROS-MOLL POLYNOMIALS
Extended Zeilberger's algorithm for identities on Bernoulli and Euler polynomials
Derangement Polynomials and Excedances of Type B
Faulhaber's theorem on power sums
On the combinatorics of the Pfaff identity
Pairs of noncrossing free Dyck paths and noncrossing partitions
Families of sets with intersecting clusters
Infinite paths in planar graphs V, 3-indivisible graphs
Hamilton circles in planar locally finite graphs
Identities from weighted Motzkin paths
Community structures of networks
Stanley's zrank conjecture on skew partitions
Labeled partitions and the q-derangement numbers
On Postnikov's hook length formula for binary trees
Linked partitions and linked cycles
Contractible subgraphs in k-connected graphs
The butterfly decomposition of plane trees
Matrix identities on weighted partial Motzkin paths
On the reconstruction of planar graphs
Checking the reliability of a linear-programming based approach towards detecting community structur
Truncation for low-complexity MIMO signal detection