Belmont University students Sergei Temkin and Eninka Kombe presented their research on “Unrestricted Partitions of Integers” at the 2005 Fall Conference of the Association for Computing Machinery (ACM), Mid-Southeast Chapter. Founded in 1947, ACM is a major force in advancing the skills of information technology professionals and students worldwide. The Mid-Southeast Chapter covers six states, and is one of the oldest in the ACM.
The research began with a class project in Discrete Mathematics. Temkin and Kombee examined the methods for counting and creating partitions of integers. After further research, the pair found that one of their algorithms had already been invented, but that another algorithm had never before been published. They have been working on the problem together for a year so far, and hope to submit a paper for publication early next year.
