Discrete Mathematics – Combinatorics, Counting, Proofs, Recurrences, Solutions (eng)

Discrete Mathematics presents the material in an easily accessible manner. Beside the usual content (expanded a little bit), a special writing style is used.

We start with the natural numbers, function and relations, as well as the powerset lattice. The second chapter illustrates set theory with its laws and the Generalized Continuum Hypothesis. Chapter 3 delivers Boolean Algebra, with the double exponential formula for the # different boolean functions. The next chapter covers the induction, direct, and indirect proof. Chapter 5 presents combinatorics: Rules of sum, product, quotient, the pigeonhole principle, in/exclusion, permutation and binomial coefficient, plus Stirling numbers of 1^st and 2^nd kind as well as the Bell number; additionally, the recurrence relation with back- and forward reasoning is offered. We conclude with general and conditional probability, incl. the Monty Hall problem.

Discrete Mathematics presents the material in a lively fashion, including topics which are usually not presented. Providing an annex with questions and solutions it offers the chance to the readers worldwide to grasp the subject in this handy and clearly arranged treatise.

Walter Hower was born into a farming family. After Kindergarten and primary as well as secondary school he attended the high school – and enjoyed his favourite subject Mathematics. After his military period as air force NATO soldier he studied Computer Science (including the minor Economics) – with the main focus on Artificial Intelligence – at the University of Kaiserslautern, with a really heavy pillar on Mathematics (incl. Mathematik für Informatiker II [Prof. Dr. Heinz Lüneburg]). Already at that time he thought about the need or an alternative to present this difficult material – the inspiration for this book.

Under supervision of Prof. PhD Jörg Siekmann he obtained the university (master) degree "Diplom-Informatiker". Later on, he worked as research assistant under the guidance of Prof. Dr. W. Bibel and as PhD candidate in the group of Prof. Dr. Manfred Rosendahl, where he obtained the degree "Dr. rer. nat." for his doctoral thesis "On constraint satisfaction and computer-aided layout design". Immediately afterwards, Dr. Hower accepted the offer by Prof. PhD Jim Bowen to head a research group at University College Cork, National University of Ireland, where he invigorates an expert team on Constraint Processing – which finally evolved into the famous Cork Constraint Computation Centre. After a period in research labs and business companies, since more than 20 years the author now works as professor for Computer Science and Fundamentals of Mathematics; he can be reached as follows:

Albstadt-Sigmaringen University, Fakultät Informatik, Poststr. 6, D-72458 Albstadt-Ebingen, hower@hs-albsig.de.

Prof. Dr. Hower received the Teaching Prize 2006 of the state Baden-Württemberg and germany-wide the 3^rd place Professor of the Year in Engineering / Computer Science in 2009.

Scientific activities include:

A Lattice-based Constraint Formalism, First Australian Knowledge Engineering Congress, Workshop on AI & Creativity, Melbourne, Australia, March 14/15, 1989;

The Relaxation of Unsolvable CSPs – General Problem Formulation and Specific Illustration in the Scheduling Domain, IJCAI-89 Workshop on Constraint Processing, Detroit, USA, August 20, 1989;

Parallel global constraint satisfaction, IJCAI-91 Workshop on Parallel Processing for Artificial Intelligence (PPAI-91), Darling Harbour, Sydney, New South Wales, Australia, August 24/25, 1991;

Notes on complexity issues within constraint satisfaction, In IJCAI-93 Workshop on Knowledge-based Production Planning, Scheduling and Control, pp. 179–186, Chambéry, Savoie, France, August 29, 1993 (co-author);

Constraint Processing – Part I/II, Department of Mathematics and Computing Science, The University of the South Pacific, Suva, Fiji, March 29/30, 1994;

On an improvement of a global algorithm for the NP-complete constraint satisfaction problem, International Computer Science Institute, Berkeley, California, USA, June 21, 1996;

Computational Complexity in Constraint-based Combinatorial Auctions, INFORMATIK 2008, 38. Jahrestagung der Gesellschaft für Informatik, München, September 8–13, 2008 (co-author);

https://educ.ethz.ch/content/dam/ethz/special-interest/dual/educeth-dam/documents/Unterrichtsmaterialien/informatik/Recurrence%20Relations%20and%20Induction%20Proofs/educETH_WHo.pdf", Zürich, Switzerland, 2008;

Boolean Algebra and Probability Theory, EU Erasmus guest professor, Angers, France, November 2008;

Reviewer for the Engineering and Physical Sciences Research Council, UK, 1996.

His research interests are combinatorial optimization as well as cooperative and non-cooperative game theory.

A lively insight into presentations of the author (on the identical cardinality of N with just the natural even numbers as well as on the funny Monty Hall problem) could be possible – although in German – via https://www.youtube.com/watch?v=zeCCMOHVS3w.