Macaulay posets
From MaRDI portal
Publication:2583307
Summary: Macaulay posets are posets for which there is an analogue of the classical Kruskal-Katona theorem for finite sets. These posets are of great importance in many branches of combinatorics and have numerous applications. We survey mostly new and also some old results on Macaulay posets, where the intention is to present them as pieces of a general theory. In particular, the classical examples of Macaulay posets are included as well as new ones. Emphasis is also put on the construction of Macaulay posets, and their relations to other discrete optimization problems.
Recommendations
Cited in
(19)- Characterizing profiles of \(k\)-families in additive Macaulay posets
- Log-concavity and compressed ideals in certain Macaulay posets
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- Bigraded Betti numbers of certain simple polytopes
- The vertex isoperimetric problem for the powers of the diamond graph
- Partially ordered sets in Macaulay2.
- Minimal families in terms of double-sided shadow in the Boolean cube layer
- MacMahon’s Dream
- Wild McEliece Incognito
- Grover vs. McEliece
- scientific article; zbMATH DE number 3914379 (Why is no real title available?)
- A Kruskal-Katona type theorem for integer partitions
- scientific article; zbMATH DE number 1303527 (Why is no real title available?)
- scientific article; zbMATH DE number 1420980 (Why is no real title available?)
- McGee on Horwich
- A new approach to Macaulay posets
- Macaulay posets and rings
- Constructions of Macaulay posets and Macaulay rings
- A generalized Macaulay theorem and generalized face rings
This page was built for publication: Macaulay posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583307)