Sufficient Conditions for a Symmetric Chain Order

DOI10.1137/0132068MaRDI QIDQ4132564zbMATH OpenOpenAlexFDO

Authors J. Griggs

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

Mathematics Subject Classification ID

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

Cited in

(40)

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

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)