scientific article; zbMATH DE number 4200270

MaRDI QIDQ3348951zbMATH OpenFDO

Authors Sergey Fomin

Publication date 1990

zbMATH Keywords

antichainschainsduality theoremmaximal elementsmaximal number of elementsrecursive algorithmYoung diagram

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An algorithmic approach to maximal unions of chains in a partially ordered set
• Algorithms over partially ordered sets
• Algorithms for dualization over products of partially ordered sets
• Some algorithms based on the dual of Dilworth's theorem
• Two easy duality theorems for product partial orders

Cited in

(11)

• Some algorithms based on the dual of Dilworth's theorem
• Optimization over Young diagrams
• Invariant computation in a poset. Convergence to a chain
• An algorithmic approach to maximal unions of chains in a partially ordered set
• scientific article; zbMATH DE number 1154176 (Why is no real title available?)
• scientific article; zbMATH DE number 905031 (Why is no real title available?)
• Algorithms for dualization over products of partially ordered sets
• Algorithms over partially ordered sets
• Finite posets and Ferrers shapes
• Research problems
• A note on covering Young diagrams with applications to local dimension of posets

This page was built for publication:

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