This is the github page of The final project for MAA205 - Algorithms for Discrete Mathematics at Ecole Polytechnique provided by Professor Lucas Gerin. The whole ...

Generating subsets is the process of finding all the subsets of a given set. A subset is a collection of elements from the original set, where the order of the elements does not matter and duplicates ...

ABSTRACT: We obtain a closed form expression for the joint probability mass function of the occupation times for a Three-State Markov chain. Our representation extends the long-standing result for a ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

ABSTRACT: The convolution of two rational transfer functions is also rational, but a formula for the convolution has never been derived. This paper introduces a formula for the convolution of two ...

Elkies, Noam D., and Scott Duke Kominers. "Weighted Generating Functions for Type II Lattices and Codes." In Quadratic and Higher Degree Forms. Vol. 31, edited by Alladi Krishnaswami, Manjul Bhargava, ...