[Paper Review] On a conjecture about enumerating $(2+2)$-free posets

Sherry H.F. Yan|arXiv (Cornell University)|Jun 7, 2010

Advanced Combinatorial Mathematics3 references4 citations

TL;DR

This paper provides a combinatorial proof of a conjecture by Kitaev and Remmel on the generating function for unlabeled (2+2)-free posets, parameterized by size and number of minimal elements. By establishing a bijection between proper (0,1)-matrices and (2+2)-free posets via ascent sequences and matrix transformations, the authors confirm that the generating function equals ∑ₙ≥₀ ∏ᵢ₌₁ⁿ (1 − (1−t)ⁱ⁻¹(1−zt)), resolving the conjecture combinatorially.

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.

Motivation & Objective

• To resolve a conjecture by Kitaev and Remmel on the generating function for unlabeled (2+2)-free posets with respect to size and number of minimal elements.
• To provide a combinatorial proof of the conjectured generating function, avoiding functional equations and the kernel method.
• To establish a bijection between proper (0,1)-matrices and (2+2)-free posets via ascent sequences and matrix transformation algorithms.
• To demonstrate that the generating function for posets with k minimal elements matches the conjectured form ∑ₙ≥₀ ∏ᵢ₌₁ⁿ (1 − (1−t)ⁱ⁻¹(1−zt)).

Proposed method

• Define the set of upper triangular (0,1)-matrices with non-negative entries and column sums equal to 1, called proper matrices, to model the structure of (2+2)-free posets.
• Introduce two algorithms: a removal algorithm to transform improper matrices into proper ones, and an addition algorithm to reverse the process.
• Use the removal and addition algorithms to construct a bijection between the set of proper matrices with first row sum k and the set of (2+2)-free posets with k minimal elements.
• Leverage the known bijection between ascent sequences and (2+2)-free posets to translate the count of minimal elements into the number of zeros in ascent sequences.
• Prove that the generating function for proper matrices with first row sum k matches the conjectured generating function by showing equality of coefficients.
• Verify that specializing z=1 recovers the known generating function for the total number of (2+2)-free posets, confirming consistency with prior results.

Experimental results

Research questions

• RQ1 Does the generating function for (2+2)-free posets with respect to size and number of minimal elements admit a closed-form expression matching the conjectured form?
• RQ2 Can the conjectured generating function be proven combinatorially using matrix structures and bijections?
• RQ3 Is there a direct correspondence between the number of minimal elements in a (2+2)-free poset and the number of zeros in an associated ascent sequence?
• RQ4 Can the structure of proper (0,1)-matrices model the statistics of minimal elements in (2+2)-free posets?
• RQ5 Does the removal and addition algorithm preserve the first row sum and ensure a well-defined bijection between matrix and poset classes?

Key findings

• The conjectured generating function P(t,z) = ∑ₙ≥₀ ∏ᵢ₌₁ⁿ (1 − (1−t)ⁱ⁻¹(1−zt)) is confirmed to correctly enumerate (2+2)-free posets by size and number of minimal elements.
• A bijection is constructed between the set of proper (0,1)-matrices with first row sum k and the set of (2+2)-free posets with k minimal elements.
• The removal and addition algorithms preserve the first row sum and ensure that the resulting matrices are proper, establishing a reversible transformation.
• The generating function for proper matrices matches the conjectured form, proving the conjecture combinatorially without functional equations.
• Specializing z=1 yields the known generating function for the total number of (2+2)-free posets, confirming consistency with Bousquet-Mélou et al.'s result.
• The proof establishes a direct combinatorial link between ascent sequences, (2+2)-free posets, and matrix structures, enriching the combinatorial framework for these objects.