Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COMBINATORICS
2004

favoriteEmaildiscussreport

99views more COMBINATORICS 2004»

A Fast Algorithm for MacMahon's Partition Analysis

13 years 4 months ago

A Fast Algorithm for MacMahon's Partition Analysis

Download www.combinatorics.net.cn

This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immediately from its partial fraction decomposition. We combine the theory of iterated Laurent series and a new algorithm for partial fraction decompositions to obtain a fast algorithm for MacMahon's Omega calculus, which (partially) avoids the "run-time explosion" problem when eliminating several variables. We discuss the efficiency of our algorithm by investigating problems studied by Andrews and his coauthors; our running time is much less than that of their Omega package.

Guoce Xin

Real-time Traffic

Algorithm | COMBINATORICS 2004 | Constant Term | Partial Fraction Decompositions |

claim paper

Related Content

» Epsilon Equitable Partition A positional analysis method for large social networks

» A fast nearest neighbor search algorithm by nonlinear embedding

» Fast and accurate computation of equidepth histograms over data streams

» A fast divisive clustering algorithm using an improved discrete particle swarm optimizer

» Graph Partition by SwendsenWang Cuts

» Fast Estimation of Nonparametric Kernel Density Through PDDP and its Application in Textur...

» Learning to Predict Salient Regions from Disjoint and Skewed Training Sets

» Learning in Gibbsian Fields How Accurate and How Fast Can It Be

» Fast mining of complex timestamped events

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMBINATORICS
Authors	Guoce Xin

Comments (0)