maths.free › Combinatorics & Graph Theory › Partially Ordered Sets › Linear Extensions of Partially Ordered Sets

Linear Extensions of Partially Ordered Sets

Let \PXP be a partially ordered set. A linear order L on X is called a linear extension (also, a topological sort) of P, if x\lt y in L whenever x\lt y in P.

Linear Extensions of Partially Ordered Sets

Let \(\PXP\) be a partially ordered set. A linear order \(L\) on \(X\) is called a linear extension (also, a topological sort) of \(P\), if \(x\lt y\) in \(L\) whenever \(x\lt y\) in \(P\). For example, the table displayed in shows that our familiar example \(\bfP_3\) has11 linear extensions.

The classical sorting problem studied in all elementary computer science courses is to determine an unknown linear order \(L\) of a set \(X\) by asking a series of questions of the form: Is \(x\lt y\) in \(L\)? All the well known sorting algorithms (bubble sort, merge sort, quick sort, ) proceed in this manner.

Here is an important special case: determine an unknown linear extension \(L\) of a poset \(\bfP\) by asking a series of questions of the form: Is \(x \lt y\) in \(L\)?

Nígbà yìí Kò ní kọ́ǹpútà alágbèéká kan tí o lè fi àwọn à

Fi iṣẹ́ rẹ̀ pamọ́

A free account adds notes on every lesson, a record of what you have finished, your solved problems in one place, and a tutor you can ask about this page. The maths itself is open to everyone, signed in or not.

Fikún Àwọn Ìṣàmúlò-ètò

Àwọn àmì-ìwé tí a lo níbẹ̀

Tẹ àwọn àmì-ìwé fún ìṣàfarawé fún àwọn ìṣàmúlò-ètò, àwòrán, àti àwọn àmì-ìwé àwọn àmì-ìwé.

Àwọn Àtòjọ-ẹ̀yàn

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Àwọn ààyè ojú-ìwé yìí tí a fi pamọ́ láti Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Tí a fi pamọ́ síì níbẹ̀; àwọn àwọn àṣiṣe ní wa.

Diẹ̀ nínú Combinatorics & Graph Theory

The counting principles Pigeonhole principle and inclusion, exclusion Binomial coefficients and Pascal's triangle Recurrences and generating functions Graphs: vertices, edges, degrees Paths, cycles, trees, Euler and Hamilton Colouring and planar graphs