Home / Combinatorics

Combinatorics

Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. It includes counting, permutations, combinations, and graph theory, with applications in computer science, optimization, and probability.

Combinatorics Topics

Permutation

Permutation

An arrangement of objects in a specific order. The number of permutations of n distinct objects is n factorial (n!).

An arrangement of objects in a specific order. The number of permutations of n distinct objects is n factorial (n!). This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Permutation.

Permutations and Combinations

A permutation is an ordered arrangement of objects. The number of permutations of n objects taken r at a time is P(n,r) = n!/(n-r)!. A combination is an unordered selection; C(n,r) = n!/(r!(n-r)!). These are the building blocks of counting problems in probability and discrete mathematics.

\[ \binom{n}{r} = \frac{n!}{r!(n-r)!} \]

The Pigeonhole Principle

If n+1 objects are placed into n containers, at least one container holds two or more objects. This simple principle has powerful applications: among any 13 people, at least two share a birth month; in any group of 5 integers, two have the same remainder when divided by 4.

Graph Theory

A graph G = (V, E) consists of vertices V and edges E. Graph theory studies connectivity, paths, cycles, trees, and colorings. Key results include Euler's theorem on traversable graphs, Hamiltonian paths, and the four-color theorem. Graphs model networks, social connections, routing problems, and molecular structures.

\[ \sum_{v \in V} \deg(v) = 2|E| \]

Generating Functions

A generating function encodes a sequence as the coefficients of a formal power series. They are powerful tools for solving recurrence relations, proving combinatorial identities, and counting problems. The ordinary generating function of the Fibonacci sequence satisfies F(x) = x/(1-x-x²).

Combination

Combination

A selection of items from a collection where the order of selection does not matter. Counted using binomial coefficients.

A selection of items from a collection where the order of selection does not matter. Counted using binomial coefficients. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Combination.

Binomial Theorem

Binomial Theorem

A formula for expanding powers of binomials. Describes the algebraic expansion of powers of a sum (a + b)^n.

A formula for expanding powers of binomials. Describes the algebraic expansion of powers of a sum (a + b)^n. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Binomial Theorem.

Pascal's Triangle

Pascal's Triangle

A triangular array of binomial coefficients. Each number is the sum of the two directly above it.

A triangular array of binomial coefficients. Each number is the sum of the two directly above it. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Pascal's Triangle.

Graph Theory

Graph Theory

The study of graphs, which are mathematical structures used to model pairwise relations between objects.

The study of graphs, which are mathematical structures used to model pairwise relations between objects. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Graph Theory.

Tree

Tree (Graph Theory)

An undirected graph in which any two vertices are connected by exactly one path. A fundamental structure in computer science.

An undirected graph in which any two vertices are connected by exactly one path. A fundamental structure in computer science. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Tree (Graph Theory).

Inclusion-Exclusion Principle

Inclusion-Exclusion Principle

A counting technique for computing the size of the union of multiple sets by adding and subtracting their intersections.

A counting technique for computing the size of the union of multiple sets by adding and subtracting their intersections. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Inclusion-Exclusion Principle.

Pigeonhole Principle

Pigeonhole Principle

If n items are put into m containers, with n > m, then at least one container must contain more than one item.

If n items are put into m containers, with n > m, then at least one container must contain more than one item. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Pigeonhole Principle.

Generating Function

Generating Function

A formal power series whose coefficients encode information about a sequence. A powerful tool in combinatorics.

A formal power series whose coefficients encode information about a sequence. A powerful tool in combinatorics. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Generating Function.

Recurrence Relation

Recurrence Relation

An equation that recursively defines a sequence. Each term is defined as a function of preceding terms.

An equation that recursively defines a sequence. Each term is defined as a function of preceding terms. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Recurrence Relation.

Fibonacci Sequence

Fibonacci Sequence

A sequence where each number is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13...

A sequence where each number is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13... This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Fibonacci Sequence.

Catalan Number

Catalan Number

A sequence of natural numbers with applications in counting problems, appearing in various combinatorial structures.

A sequence of natural numbers with applications in counting problems, appearing in various combinatorial structures. This topic is fundamental to understanding advanced mathematics and has wide applications in science and engineering.

Key concepts: definitions, theorems, proofs, and worked examples related to Catalan Number.