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\)?

Nå har du Ingen kalkulator setter opp denne, men brikkene kan brukes. Prøv en nedenfor eller skriv inn din egen.

Fortsett ditt eget arbeid

En gratis konto legger til notater om hver leksjon, en oversikt over hva du har fullført, problemene du har løst på ett sted og en lærer du kan spørre om. Matematikkene er åpne for alle, signerte på eller ikke.

Registrer Logg inn

Symboler som brukes her

Trykk på et symbol for den fulle definisjonen, et bilde og hva hver bokstav i det betyr.

Spørsmål folk stiller

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.

Deler av denne siden er tilpasset fra Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Kondensert og re-forklaret her, feil er vår.

Mer i Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs