Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

In this paper we prove the following theorem: let G be a discrete amenable group with nontrivial almost-periodic compactification, and let F be a complex-valued function defined in [-1, 1]; then F ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Mathematics of Operations Research, Vol. 41, No. 1 (February 2016), pp. 146-173 (28 pages) This paper investigates the problem of maximizing expected terminal utility in a (generically incomplete) ...