LOWER BOUNDS OF THE NUMBER OF JUMP OPTIMAL LINEAR EXTENSIONS : PRODUCTS OF SOME POSETS
Hyung Chan Jung
Abstract
Hyung Chan Jung
Abstract
Let P be a finite poset and let P be the number of vertices in pp. A subposet of P is a subset of P with the induced order. A chain C in P is a subposet of P which is a linear order. The length of the chain C is C - 1. A linear extension of a poset P is a linear order $L = x_1, x_2, \ldots, x_n$ of the elements of P such that $x_i
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let P be a finite poset and let P be the number of vertices in pp. A subposet of P is a subset of P with the induced order. A chain C in P is a subposet of P which is a linear order. The length of the chain C is C - 1. A linear extension of a poset P is a linear order $L = x_1, x_2, \ldots, x_n$ of the elements of P such that $x_i
Key concepts: Partially ordered set, Linear extension, Mathematics, Order (exchange), Combinatorics, Chain (unit), Jump, Extension (predicate logic)