A DIOPHANTINE CONSTRUCTION OF AN EXACT ALGEBRAIC FORMULA FOR GRADED PARTITION FUNCTIONS

  • Soh, Sun-T.
  • Published : 1999.03.01

Abstract

A geometric construction of an exact algebraic formula for graded partition functions, of which a special one is the classical unrestricted partition function p(n), from a diophantine point of view is presented. Moreover, the involved process allows us to compute the value of a graded partition function in an inductive manner with a geometrically built-in self-error-checking ability at each step for correctness of the computed values of the partition function under consideration.

Keywords

complete intersections;computation of partition functions

References

  1. Topics in Algebra (2nd Ed) I. N. Herstein
  2. Encyclopedic Dictionary of Mathematics (2nd Ed.) v.2 Math. Soc. of Japan
  3. Efficient Formulas for the Coefficients of the Gaussian Polynomials$\frac{n}{m}$
  4. Enumerative Combinatorics v.I R. P. Stanley
  5. The Theory of Partitions (2nd printing) G. E. Andrews
  6. A First Course, GTM129 Representation Theory W. Fulton;J. Harris
  7. An Introduction to the Theory of Numbers (5th Ed.) I. Niven (et al.)
  8. Romanujan's Notebooks B. C. Berndt
  9. Texts and Monographs in Symbolic Computation Algorithms in Invariant Theory B. Sturmfels
  10. An Introduction to the Theory of Numbers (5th Ed) G. H. Hardy;E. M. Wright
  11. Number Theory G. E. Andrews
  12. RIM-GARC Preprint Series 95-15, Research Institute of Math. On a Complete Intersection Sun T. Soh
  13. J. Math. Assoc v.81 no.490 Computations of the partition function, The Mathematical Gazette P. Shiu
  14. (Quasi-) Recursive Formulas for Graded Partition Functions Sun T. Soh
  15. Topics from the Theory of Numbers E. Grosswald