Order, lattices, ordered algebraic structures Definition
Series-parallel partial order
Builds on Partial orderOrdinal sum of posetsDisjoint union of posets
Definition
The class of series-parallel partial orders is the smallest class of finite partially ordered sets such that:
- every one-element poset is in ;
- if and are in , then their ordinal sum is in ;
- if and are in , then their disjoint union is in ;
- every poset isomorphic to a member of is in .
Remarks
Example: the poset with , and , incomparable is , so it is series-parallel. Non-example: the poset on with , , as the only strict relations is not series-parallel. It is connected, so it is not a disjoint union of two nonempty posets. It is not an ordinal sum of two nonempty posets either. Nothing lies below , so would be in , and every element of would be above . The only element above is , so , but would then be below , which fails. A finite poset is series-parallel if and only if it has no subposet isomorphic to . Total orders and antichains are series-parallel.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Disjoint union of posets concept
- Ordinal sum of posets concept
- Partial order concept
- Series-parallel partial order definition
Further reading
About this page
| Tag | 9G8XXBG9F3 |
|---|---|
| URI | m2://9G8XXBG9F3 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A07, 06A06 |
| Defines | Series-parallel partial order |
| Uses | Partial order, Ordinal sum of posets, Disjoint union of posets |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.