https://mklab.gr/ Wed, 29 Jul 2026 08:23:13 +0000 MyBB https://mklab.gr/showthread.php?tid=344 Sun, 14 Jun 2026 15:47:14 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=344 Concrete Mathematics 
by Donald Knuth

Summary  Concrete Mathematics: A Foundation for Computer Science (co-authored by Ronald Graham, Donald Knuth, and Oren Patashnik) is a legendary textbook that bridges discrete and continuous math. It serves as a rigorous, problem-solving toolkit for computer scientists and algorithm designers, distinguished by its conversational, light-hearted tone.

BOOK PAGE]]> Concrete Mathematics 
by Donald Knuth

Summary  Concrete Mathematics: A Foundation for Computer Science (co-authored by Ronald Graham, Donald Knuth, and Oren Patashnik) is a legendary textbook that bridges discrete and continuous math. It serves as a rigorous, problem-solving toolkit for computer scientists and algorithm designers, distinguished by its conversational, light-hearted tone.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=336 Sun, 14 Jun 2026 15:24:26 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=336 Collection ofproblems in probability theory
 by Meshalkin

Summary  Collection of Problems in Probability Theory by L.D. Meshalkin is a classic problem book intended for university mathematics and physics students. Originally published in Russian, it contains 500 carefully curated exercises that span the foundational to advanced concepts of probability theory

BOOK PAGE]]> Collection ofproblems in probability theory
 by Meshalkin

Summary  Collection of Problems in Probability Theory by L.D. Meshalkin is a classic problem book intended for university mathematics and physics students. Originally published in Russian, it contains 500 carefully curated exercises that span the foundational to advanced concepts of probability theory

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=335 Sun, 14 Jun 2026 15:21:58 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=335 Combinatorial Mathematics
by N. Vilenkin

Summary  In the present book, the aim has been to set forth a variety of combinatorial problems in popular form and understandable language. At the same time, an attempt is made to present some rather involved combinatorial problems and to give the reader an idea of the methods of recurrence relations and generating functions.  The first chapter is devoted to the general rules of combinatorics, the rules of sum and product. In the second chapter we investigate permutations and combinations. This traditionally grade-school material is accompanied by an analysis of some amusing examples. In the third chapter, a study is made of combinatorial problems in which certain restrictions are imposed on the combinations. Chapter IV considers problems involving partitions of numbers into integers and- contains a description of certain geometrical methods in combinatorics. Chapter V is devoted to random-walk problems and to a variety of modifications of the arithmetic triangle. Chapter VI takes up recurrence relations, and Chapter VII discusses generating functions and, in particular, the binomial formula. The last section of the book is devoted to combinatorial problems of which there are over 400.  This material has been taken from a variety of sources, including Whitworth's Choice and Chance (London, 1901), John Riordan's An Introduction to Combinatorial Analysis (New York, 1958), an interesting book by A. M. Yaglom and I. M. Yaglom entitled Nonelementary Problems in an Elementary Exposition (Moscow, 1954), and various collections of problems given at mathematical Olympiads in the USSR.

BOOK PAGE]]> Combinatorial Mathematics
by N. Vilenkin

Summary  In the present book, the aim has been to set forth a variety of combinatorial problems in popular form and understandable language. At the same time, an attempt is made to present some rather involved combinatorial problems and to give the reader an idea of the methods of recurrence relations and generating functions.  The first chapter is devoted to the general rules of combinatorics, the rules of sum and product. In the second chapter we investigate permutations and combinations. This traditionally grade-school material is accompanied by an analysis of some amusing examples. In the third chapter, a study is made of combinatorial problems in which certain restrictions are imposed on the combinations. Chapter IV considers problems involving partitions of numbers into integers and- contains a description of certain geometrical methods in combinatorics. Chapter V is devoted to random-walk problems and to a variety of modifications of the arithmetic triangle. Chapter VI takes up recurrence relations, and Chapter VII discusses generating functions and, in particular, the binomial formula. The last section of the book is devoted to combinatorial problems of which there are over 400.  This material has been taken from a variety of sources, including Whitworth's Choice and Chance (London, 1901), John Riordan's An Introduction to Combinatorial Analysis (New York, 1958), an interesting book by A. M. Yaglom and I. M. Yaglom entitled Nonelementary Problems in an Elementary Exposition (Moscow, 1954), and various collections of problems given at mathematical Olympiads in the USSR.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=281 Wed, 10 Jun 2026 23:47:39 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=281 Discrete Mathematics: An Open Introduction
by Oscar Levin.

Summary
Four main topics of this book: combinatorics (the theory of ways things combine and how to count these ways), sequences, symbolic logic, and graph theory. This new edition starts with logic and proofs, then  practices those proofs with graph theory.  The second half of the book  contains material on counting (with a new "application to probability" section) and sequences. There's also a  stronger emphasis on discrete structures, which should make the book more  useful for students in Computer Science, while still focusing on understanding mathematical concepts essential for math majors and future  math TEACHERS.

BOOK PAGE]]> Discrete Mathematics: An Open Introduction
by Oscar Levin.

Summary
Four main topics of this book: combinatorics (the theory of ways things combine and how to count these ways), sequences, symbolic logic, and graph theory. This new edition starts with logic and proofs, then  practices those proofs with graph theory.  The second half of the book  contains material on counting (with a new "application to probability" section) and sequences. There's also a  stronger emphasis on discrete structures, which should make the book more  useful for students in Computer Science, while still focusing on understanding mathematical concepts essential for math majors and future  math TEACHERS.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=266 Wed, 10 Jun 2026 06:50:03 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=266 Topics in Discrete Mathematics
by A.F. Pixley

Summary

Topics in Discrete Mathematics by A.F. Pixley is a textbook focused on introducing advanced mathematical reasoning. The core curriculum covers five main areas: Combinatorics, The Integers, The Discrete Calculus, Order and Algebra, and Finite State Machines


BOOK PAGE]]> Topics in Discrete Mathematics
by A.F. Pixley

Summary

Topics in Discrete Mathematics by A.F. Pixley is a textbook focused on introducing advanced mathematical reasoning. The core curriculum covers five main areas: Combinatorics, The Integers, The Discrete Calculus, Order and Algebra, and Finite State Machines


BOOK PAGE]]> https://mklab.gr/showthread.php?tid=264 Wed, 10 Jun 2026 06:35:05 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=264 Applied Discrete Structures
by Al Doerr, Ken Levasseur


Summary  Applied Discrete Structures, is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.

BOOK PAGE]]> Applied Discrete Structures
by Al Doerr, Ken Levasseur


Summary  Applied Discrete Structures, is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=239 Wed, 10 Jun 2026 03:04:05 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=239 Combinatorics Through Guided Discovery 
Kenneth P. Bogart

Summary  This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.

BOOK PAGE]]> Combinatorics Through Guided Discovery 
Kenneth P. Bogart

Summary  This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=213 Wed, 10 Jun 2026 01:28:33 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=213 A Course in Combinatorial Optimization
by Alexander Schrijver

Summary  A Course in Combinatorial Optimization by Alexander Schrijver is a rigorous, advanced textbook that establishes a cohesive theoretical framework for solving combinatorial problems. It heavily emphasizes the connection between discrete combinatorial structures and continuous linear optimization, using polyhedral techniques and duality as the primary workhorses for algorithm design and analysis

BOOK PAGE]]> A Course in Combinatorial Optimization
by Alexander Schrijver

Summary  A Course in Combinatorial Optimization by Alexander Schrijver is a rigorous, advanced textbook that establishes a cohesive theoretical framework for solving combinatorial problems. It heavily emphasizes the connection between discrete combinatorial structures and continuous linear optimization, using polyhedral techniques and duality as the primary workhorses for algorithm design and analysis

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=210 Wed, 10 Jun 2026 01:19:14 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=210 Applied Finite Mathematics
by Rupinder Sekhon

Summary  Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.

BOOK PAGE]]> Applied Finite Mathematics
by Rupinder Sekhon

Summary  Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=204 Wed, 10 Jun 2026 00:54:43 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=204 Combinatorial Fundamentals of Algebra
by Darij Grinberg

Summary  This is a detailed survey, with rigorous and self-contained proofs, of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is entirely expository and written to a large extent as a repository for folklore proofs; no new results appear.

BOOK PAGE]]> Combinatorial Fundamentals of Algebra
by Darij Grinberg

Summary  This is a detailed survey, with rigorous and self-contained proofs, of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is entirely expository and written to a large extent as a repository for folklore proofs; no new results appear.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=203 Wed, 10 Jun 2026 00:40:08 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=203 Graph Theory
by Reinhard Diestel

Summary  This standard textbook of modern graph theory, now in its sixth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail.

BOOK PAGE]]> Graph Theory
by Reinhard Diestel

Summary  This standard textbook of modern graph theory, now in its sixth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=193 Tue, 09 Jun 2026 23:54:54 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=193 Counting Rocks! An Introduction to Combinatorics
by Henry Adams

Summary  This textbook is the written component of an interactive introduction to combinatorics at the undergraduate level. The major topics in this text are counting problems, proof techniques, recurrence relations and generating functions, and an introduction to graph theory.

BOOK PAGE]]> Counting Rocks! An Introduction to Combinatorics
by Henry Adams

Summary  This textbook is the written component of an interactive introduction to combinatorics at the undergraduate level. The major topics in this text are counting problems, proof techniques, recurrence relations and generating functions, and an introduction to graph theory.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=192 Tue, 09 Jun 2026 23:49:21 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=192 generatingfunctionology 
Author Herbert Wilf

Summary  Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov Chains - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.

BOOK PAGE]]> generatingfunctionology 
Author Herbert Wilf

Summary  Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov Chains - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.

BOOK PAGE]]> https://mklab.gr/showthread.php?tid=191 Tue, 09 Jun 2026 23:45:45 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=191 Analytic Combinatorics 
Authors Philippe Flajolet and Robert Sedgewick

Summary  Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick is the definitive text on the mathematics of combinatorial enumeration. It unites symbolic enumeration methods with complex analysis to predict properties of large combinatorial structures like trees, graphs, and permutations


BOOK PAGE

BOOK PAGE 2]]> Analytic Combinatorics 
Authors Philippe Flajolet and Robert Sedgewick

Summary  Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick is the definitive text on the mathematics of combinatorial enumeration. It unites symbolic enumeration methods with complex analysis to predict properties of large combinatorial structures like trees, graphs, and permutations


BOOK PAGE

BOOK PAGE 2]]> https://mklab.gr/showthread.php?tid=190 Tue, 09 Jun 2026 23:42:09 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=190 Title : Applied Combinatorics  
Authors Mitchel T. Keller, William T. Trotter

Summary  Applied Combinatorics is an open-source textbook for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (graphs, digraphs, posets, interval orders), and discrete optimization (minimum weight spanning trees, shortest paths, network flows). There are also chapters introducing discrete probability, Ramsey theory, combinatorial applications of network flows, and a few other nuggets of discrete mathematics.

BOOK PAGE]]> Title : Applied Combinatorics  
Authors Mitchel T. Keller, William T. Trotter

Summary  Applied Combinatorics is an open-source textbook for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (graphs, digraphs, posets, interval orders), and discrete optimization (minimum weight spanning trees, shortest paths, network flows). There are also chapters introducing discrete probability, Ramsey theory, combinatorial applications of network flows, and a few other nuggets of discrete mathematics.

BOOK PAGE]]>