← All problems

Jun Ma and Lin's enumeration conjecture for inversion sequences avoiding 0012

7 years old · traced to

Let In(0012)\mathbf I_n(0012) denote the set of inversion sequences of length nn avoiding the pattern 00120012. Jun Ma and Lin's conjecture. For n≥1n\geq 1, we have

∣In(0012)∣=1+∑i=1n−1(2ii−1).|\mathbf I_n(0012)|=1+\sum_{i=1}^{n-1}{2i\choose i-1}.

In other words, the unbalanced Wilf-equivalence

(0012)∼(021,120)(0012)\thicksim(021,120)

holds.

References

Status

Source: Chunyan Yan and Zhicong Lin, “Inversion sequences avoiding pairs of patterns”, arXiv:1912.03674 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.