Enumeration of graded (3+1)-avoiding posets

DOI10.1016/j.jcta.2013.03.012zbMath1278.05017arXiv1106.5480OpenAlexW2028047704MaRDI QIDQ388200

Mohammad Hasan, H. S. Yoon

Publication date: 19 December 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.5480

zbMATH Keywords

generating functionsposetsasymptotic enumeration(3+1)-avoidance

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

Related Items

ON WEAKLY GRADED POSETS OF ORDER-PRESERVING MAPS UNDER THE NATURAL PARTIAL ORDER ⋮ Catalan pairs and Fishburn triples ⋮ Structure and enumeration of \((3+1)\)-free posets ⋮ Hereditary semiorders and enumeration of semiorders by dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Brenti's conjecture about the log-concavity of the chromatic polynomial
• Counting \(\mathbf {(3+1)}\)-avoiding permutations
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• Intransitive indifference with unequal indifference intervals
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• ON THE GROUP-LIKE BEHAVIOR OF THE LE–MURAKAMI–OHTSUKI INVARIANT
• The number of graded partially ordered sets
• Structure and enumeration of (3+1)-free posets (extended abstract)
• A characterization of \((3+1)\)-free posets

This page was built for publication: Enumeration of graded (3+1)-avoiding posets