Substitution and atomic extension on greedy posets

DOI10.1007/BF00400287MaRDI QIDQ1104347zbMATH OpenFDO

Authors Jonathan Elbaz

Publication date 1986

Published in Order (Search for Journal in Brave)

zbMATH Keywords

substitutionjump numberatomic extensiongreedy posetssemi- partitive lattices

Mathematics Subject Classification ID

Partial orders, general (06A06)

Recommendations

• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• Greedy linear extensions for minimizing bumps
• Greedy posets for the bump-minimizing problem
• scientific article; zbMATH DE number 96384
• Greedy linear extensions to minimize jumps

Cites work

• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 3641455 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• N-free posets as generalizations of series-parallel posets
• On finding the jump number of a partial order by substitution decomposition
• On the size of jump-critical ordered sets
• Optimal Linear Extensions by Interchanging Chains

This page was built for publication: Substitution and atomic extension on greedy posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104347)