Math 2.0

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 𝒮\mathcal{S} of finite partially ordered sets such that:

  1. every one-element poset is in 𝒮\mathcal{S};
  2. if PP and QQ are in 𝒮\mathcal{S}, then their ordinal sum P⊕QP \oplus Q is in 𝒮\mathcal{S};
  3. if PP and QQ are in 𝒮\mathcal{S}, then their disjoint union P+QP + Q is in 𝒮\mathcal{S};
  4. every poset isomorphic to a member of 𝒮\mathcal{S} is in 𝒮\mathcal{S}.

Remarks

Example: the poset with a<b<da < b < d, a<c<da < c < d and bb, cc incomparable is {a}⊕({b}+{c})⊕{d}\set{a} \oplus (\set{b} + \set{c}) \oplus \set{d}, so it is series-parallel. Non-example: the poset NN on {a,b,c,d}\set{a, b, c, d} with a<ca < c, b<cb < c, b<db < d 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 A⊕BA \oplus B of two nonempty posets either. Nothing lies below aa, so aa would be in AA, and every element of BB would be above aa. The only element above aa is cc, so B={c}B = \set{c}, but dd would then be below cc, which fails. A finite poset is series-parallel if and only if it has no subposet isomorphic to NN. 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Disjoint union of posets concept
  2. Ordinal sum of posets concept
  3. Partial order concept
  4. Series-parallel partial order definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Series-parallel_partial_order
About this page
Tag9G8XXBG9F3
URIm2://9G8XXBG9F3
Kinddefinition
WritingW0 stub
MSC06A07, 06A06
DefinesSeries-parallel partial order
UsesPartial order, Ordinal sum of posets, Disjoint union of posets
Changed2 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.