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\)?
ឥឡូវអ្នក គ្មានម៉ាស៊ីនគិតលេខដែលអាចដោះស្រាយបញ្ហានេះបានទេ ប៉ុន្តែវាអាចគណនាបាន ។ ព្យាយាមមួយខាងក្រោម ឬវាយរបស់អ្នកផ្ទាល់ ។
គណនីឥតគិតថ្លៃបន្ថែមចំណាំលើមេរៀននីមួយៗ កំណត់ហេតុនៃអ្វីដែលអ្នកបានបញ្ចប់ បញ្ហាដែលអ្នកបានដោះស្រាយនៅកន្លែងមួយ និងគ្រូដែលអ្នកអាចសួរអំពីទំព័រនេះ ។ គណិតវិទ្យាដោយខ្លួនវាគឺបើកចំហសម្រាប់អ្នកទាំងអស់គ្នា ចុះឈ្មោះចូល ឬមិនចុះឈ្មោះចូល ។
ចុះឈ្មោះ ចូលនិមិត្តសញ្ញាដែលបានប្រើនៅទីនេះ
ចុចនិមិត្តសញ្ញាណាមួយសម្រាប់ការកំណត់ពេញលេញ រូបភាព និងតួអក្សរនីមួយៗមានន័យអ្វី ។
សំណួរដែលមនុស្សសួរ
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.
ផ្នែកនៃទំព័រនេះត្រូវបានកែប្រែពី Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). បន្សំនិងពន្យល់នៅទីនេះឡើងវិញ កំហុសគឺរបស់យើង ។
បន្ថែមទៀតក្នុង 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