Sufficient Conditions for a Symmetric Chain Order
From MaRDI portal
Publication:4132564
DOI10.1137/0132068zbMath0359.06004OpenAlexW1974280274MaRDI QIDQ4132564
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
Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Total orders (06A05)
Related Items
Semiantichains and Unichain Coverings in Direct Products of Partial Orders, Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property, Decompositions of the Boolean lattice into rank-symmetric chains., News about Semiantichains and Unichain Coverings, Matchings, cutsets, and chain partitions in graded posets, The generalized Füredi conjecture holds for finite linear lattices, Constructions of ranked posets, Symmetric decompositions and the strong Sperner property for noncrossing partition lattices, Problems on chain partitions, Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces, On chains and Sperner k-families in ranked posets, The Goldman-Rota identity and the Grassmann scheme, A symmetric chain decomposition of L(4,n), On nested chain decompositions of normalized matching posets of rank 3, On the lattice of order ideals of an up-down poset, On the structure of the lattice of noncrossing partitions, Symmetric chain decompositions of products of posets with long chains, Matchings and the sum function, Nested chain partitions of LYM posets, A statistic on involutions, Another Three Part Sperner Theorem, The necklace poset is a symmetric chain order, Parenthesizations of finite distributive lattices, Some remarks on nestings in the normalized matching posets of rank 3, The normalized matching property in random and pseudorandom bipartite graphs, On the duality of semiantichains and unichain coverings., Interval stability and interval covering property in finite posets, Methods for nesting rank 3 normalized matching rank-unimodal posets, On orthogonal symmetric chain decompositions, On the existence of symmetric chain decompositions in a quotient of the Boolean lattice, Some remarks on normalized matching, The strong Hall property and symmetric chain orders, Recognition of order-preserving maps, Symmetric chain decompositions of quotients by wreath products., Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains, Partitioning the Boolean lattice into chains of large minimum size, Counting common representatives and symmetric chain decompositions
