On a conjecture about enumerating (2+2)-free posets

DOI10.1016/J.EJC.2010.10.010zbMATH Open1206.06001arXiv1006.1226OpenAlexW2131203714WikidataQ122918573 ScholiaQ122918573MaRDI QIDQ616386FDOQ616386

Authors: Sherry H. F. Yan 

Publication date: 7 January 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Recently, Kitaev and Remmel posed a conjecture concerning the generating function for the number of unlabeled $(2+2)$-free posets with respect to number of elements and number of minimal elements. In this paper, we present a combinatorial proof of this conjecture.

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

Recommendations

• scientific article; zbMATH DE number 6806834
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• Structure and enumeration of \((3+1)\)-free posets (extended abstract).
• Structure and enumeration of \((3+1)\)-free posets
• Enumeration of functions from posets to chains

zbMATH Keywords

generating functioninvolutionascent sequenceminimal elementupper triangular matrix

Mathematics Subject Classification ID

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

Cites Work

• Vassiliev invariants and a strange identity related to the Dedekind eta-function
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• An obvious proof of Fishburn's interval order theorem
• Ascent sequences and upper triangular matrices containing non-negative integers
• Height counting of unlabeled interval and \(N\)-free posets.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• Title not available (Why is that?)
• Structure and enumeration of \((3+1)\)-free posets
• Proof of a conjecture of Proctor and Scoppetta related to \(d\)-complete posets
• On \(q\)-series identities related to interval orders
• A new decomposition of ascent sequences and Euler-Stirling statistics
• Structure and enumeration of \((3+1)\)-free posets (extended abstract).
• Fishburn trees
• Bijective proof of a conjecture on unit interval posets
• Title not available (Why is that?)
• Enumeration of functions from posets to chains
• Total nonnegativity and (3+1)-free posets
• Decomposing labeled interval orders as pairs of permutations
• Asymptotic enumeration of two-dimensional posets
• Catalan pairs and Fishburn triples
• Counting general and self-dual interval orders
• Asymptotics for the number of row-Fishburn matrices
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Equidistributed statistics on Fishburn matrices and permutations
• Asymptotics and statistics on Fishburn matrices and their generalizations
• Composition matrices, \((2+2)\)-free posets and their specializations

This page was built for publication: On a conjecture about enumerating \((2+2)\)-free posets

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