2000 character limit reached
Chain Posets
Published 16 Feb 2018 in math.CO | (1802.05813v1)
Abstract: A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets satisfy the strong Sperner property and are rank-log concave.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.