Representing an Ordered Set as the Intersection of Super Greedy Linear Extensions

Abstract

A linear extension [xt <-x2 < 1.1 <xl] of a finite ordered set Y= (P, <) is super greedy if it can be obtained using the following procedure: Choose x, to be a minimal element of 9; suppose .Y, , . . . , xL have been chosen; define p(x) to be the largest j < i such that x, < x if such a j exists and 0 otherwise; choose x,+i to be a minimal element of P{xt… (More)

5 Figures and Tables

Topics

  • Presentations referencing similar topics