In mathematics, a fence, also called a zigzag poset, is a partially ordered set (poset) in which the order relations form a path with alternating orientations: a < b > c < d > e < f > h < i ⋯ {\displaystyle a<b>c<d>e<f>h<i\cdots } or a > b < c > d < e > f < h > i ⋯ {\displaystyle a>b<c>d<e>f<h>i\cdots } A fence may be finite, or it may be formed by an infinite alternating sequence extending in both directions. The incidence posets of path graphs form examples of fences.
In mathematics, a fence, also called a zigzag poset, is a partially ordered set (poset) in which the order relations form a path with alternating orientations: a < b > c < d > e < f > h < i ⋯ {\displaystyle a<b>c<d>e<f>h<i\cdots } or a > b < c > d < e > f < h > i ⋯ {\displaystyle a>b<c>d<e>f<h>i\cdots } A fence may be finite, or it may be formed by an infinite alternating sequence extending in both directions. The incidence posets of path graphs form examples of fences.
Source: Wikipedia "Fence (mathematics)" · CC BY-SA 4.0
Share this article: X · Bluesky