Enumeration of graded (3+1)-avoiding posets

DOI10.1016/J.JCTA.2013.03.012zbMATH Open1278.05017arXiv1106.5480OpenAlexW2028047704MaRDI QIDQ388200FDOQ388200

Authors: Joel Brewster Lewis, Yan X. Zhang 

Publication date: 19 December 2013

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

Abstract: The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable definitions of the word "graded." Our proof consists of a number of structural theorems followed by some generating function magic. We also provide asymptotics for the growth rate of the number of graded (3 + 1)-avoiding posets.

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

Recommendations

• Enumeration of graded \((3+1)\)-avoiding posets
• Four variations on graded posets
• Structure and enumeration of \((3+1)\)-free posets (extended abstract).
• Counting \(\mathbf {(3+1)}\)-avoiding permutations
• Structure and enumeration of \((3+1)\)-free posets

zbMATH Keywords

generating functionsposetsasymptotic enumeration(3+1)-avoidance

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• Intransitive indifference with unequal indifference intervals
• Title not available (Why is that?)
• On Brenti's conjecture about the log-concavity of the chromatic polynomial
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• Enumeration of graded \((3+1)\)-avoiding posets
• 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
• Counting \(\mathbf {(3+1)}\)-avoiding permutations

Cited In (8)

• Counting \(\mathbf {(3+1)}\)-avoiding permutations
• Structure and enumeration of \((3+1)\)-free posets
• Enumeration of graded \((3+1)\)-avoiding posets
• Bijective proof of a conjecture on unit interval posets
• Four variations on graded posets
• Catalan pairs and Fishburn triples
• On weakly graded posets of order-preserving maps under the natural partial order
• Hereditary semiorders and enumeration of semiorders by dimension

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

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