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

Agora tu Nenhuma calculadora resolve esta, mas as peças dela são computáveis. Tente um abaixo, ou digite seu próprio.

Guarde o seu próprio trabalho

Uma conta gratuita adiciona notas sobre cada lição, um registro do que você terminou, seus problemas resolvidos em um lugar, e um tutor que você pode perguntar sobre esta página. A própria matemática está aberta a todos, assinada ou não.

Inscrever-se Login

Símbolos usados aqui

Toque em qualquer símbolo para a definição completa, uma imagem e o que cada letra nela significa.

Perguntas que as pessoas fazem

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.

Partes desta página são adaptadas a partir de Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Condensado e reexplicado aqui; erros são nossos.

Mais em 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