Sufficient Conditions for a Symmetric Chain Order

DOI10.1137/0132068zbMATH Open0359.06004OpenAlexW1974280274MaRDI QIDQ4132564FDOQ4132564

Publication date: 1977

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0132068

Permutations, words, matrices (05A05) Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17) Total orders (06A05)

Cited In (37)

On orthogonal symmetric chain decompositions
Partitioning the Boolean lattice into chains of large minimum size
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
Matchings and the sum function
Decompositions of the Boolean lattice into rank-symmetric chains.
A statistic on involutions
The Goldman-Rota identity and the Grassmann scheme
News about semiantichains and unichain coverings.
Constructions of ranked posets
Another Three Part Sperner Theorem
Parenthesizations of finite distributive lattices
Symmetric chain decompositions of products of posets with long chains
On the duality of semiantichains and unichain coverings.
The strong Hall property and symmetric chain orders
On chains and Sperner k-families in ranked posets
The normalized matching property in random and pseudorandom bipartite graphs
On the structure of the lattice of noncrossing partitions
Some remarks on nestings in the normalized matching posets of rank 3
Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains
The necklace poset is a symmetric chain order
Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces
On nested chain decompositions of normalized matching posets of rank 3
Some remarks on normalized matching
Interval stability and interval covering property in finite posets
Counting common representatives and symmetric chain decompositions
Methods for nesting rank 3 normalized matching rank-unimodal posets
Symmetric chain decompositions of quotients by wreath products.
Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
On the lattice of order ideals of an up-down poset
On the existence of symmetric chain decompositions in a quotient of the Boolean lattice
Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
Recognition of order-preserving maps
The generalized Füredi conjecture holds for finite linear lattices
Nested chain partitions of LYM posets
Problems on chain partitions
Matchings, cutsets, and chain partitions in graded posets
A symmetric chain decomposition of L(4,n)

This page was built for publication: Sufficient Conditions for a Symmetric Chain Order

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