MATH.2190 — Undergraduate Id: 008321 Offering: 1 Credits: 3-3 Description Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations.

Brief Description of Course Content The course covers fundamental ideas from discrete mathematics, especially for computer science students. It focuses on topics that will be foundational for future ...

Analogoues of classical representation formulas for entire functions of exponential type are proved in the class of discrete analytic functions. Journal Information This monthly journal, published ...

This fast discrete Walsh transform and its inverse may be used to approximate the Walsh coefficients of a function and then construct a spline interpolant of the function. This interpolant may then be ...