Partition representations: Difference between revisions

Jump to navigation Jump to search
m
Line 90: Line 90:
== Unification ==
== Unification ==


The division-based and divider-based representations are dual to one another: counting the number of elements with no divisions in between and the number of dividers with no elements in between are symmetric concepts. We can convert between then using the [[Indices]] primitive and its inverse. The following diagram shows the relationships between the four representations. Note the symmetry in the graphs for target indices and division endpoints: the graphs are essentially [[transpose]]s of one another. The [[Interval Index]] function can be used to convert between these two representations directly.
The division-based and divider-based representations are dual to one another: counting the number of elements with no divisions in between and the number of dividers with no elements in between are symmetric concepts. We can convert between them using the [[Indices]] primitive and its inverse. The following diagram shows the relationships between the four representations. Note the symmetry in the graphs for target indices and division endpoints: the graphs are essentially [[transpose]]s of one another. The [[Interval Index]] function can be used to convert between these two representations directly.


[[File:Partition representations.png|center|600px]]
[[File:Partition representations.png|center|600px]]

Navigation menu