Malaysian Mathematical, Kenjiro Ogawa, Morimasa Tsuchiya
Abstract
Two posets with the same canonical poset and the same upper bound graph can be transformed into each other by a finite sequence of two kinds of transformations, called x < y-additions and x < y-deletions on mini- mal elements.
A significance statement is not available in the OpenAlex record.
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.
Two posets with the same canonical poset and the same upper bound graph can be transformed into each other by a finite sequence of two kinds of transformations, called x < y-additions and x < y-deletions on mini- mal elements.
Key concepts: Combinatorics, Partially ordered set, Mathematics, Star product, Upper and lower bounds, Graph, Sequence (biology), Discrete mathematics