scientific article; zbMATH DE number 4200270

MaRDI QIDQ3348951zbMATH OpenFDO

Authors Sergey Fomin

Publication date 1990

zbMATH Keywords

recursive algorithmYoung diagramantichainsduality theoremmaximal elementschainsmaximal number of elements

Mathematics Subject Classification ID

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

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

(9)

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

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)