Decomposition of partial orders
From MaRDI portal
This is an application of the split decomposition theory for submodular functions [\textit{W. H. Cunningham}, Combinatorica 3, 53-68 (1983; Zbl 0518.05059)] to finite partially ordered sets. The highly decomposable finite partially ordered sets are completely characterized.
Recommendations
- Publication:4943008
- Decompositions of partially ordered sets
- A separation decomposition for orders
- A decomposition theorem for partially ordered sets
- Partial orders based on the CS decomposition
- Partial orders based on core-nilpotent decomposition
- Partial Representations of Orderings
- Decompositions and pseudo-orders of ordered semigroups
- Decomposition of a C-algebra through partial orderings
- Orders for simplifying partial partitions
Cites work
Cited in
(14)- Ordinal decompositions for preordered root systems
- Partial ordering of degrees of alternative m-reducibility
- Some algorithms based on the dual of Dilworth's theorem
- Decompositions of modules associated to finite partially ordered sets
- Orders for simplifying partial partitions
- Decomposable partial actions
- scientific article; zbMATH DE number 3845640 (Why is no real title available?)
- New applications of partial orders
- scientific article; zbMATH DE number 4010574 (Why is no real title available?)
- A separation decomposition for orders
- Decomposing labeled interval orders as pairs of permutations
- Changing the Depth of an Ordered Set by Decomposition
- Partition relations on a plain product order type
- Partial orders based on core-nilpotent decomposition
This page was built for publication: Decomposition of partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q919013)