312-Avoiding Reduced Valid Hook Configurations and Duck Words

TL;DR

This paper establishes a bijection between 312-avoiding reduced valid hook configurations and 3D-Dyck words, proving conjectures and deriving enumeration formulas related to combinatorial structures in permutation and probability theory.

Contribution

It introduces a new bijection linking reduced valid hook configurations on 312-avoiding permutations to 3D-Dyck words, confirming conjectures and providing enumeration methods.

Findings

Proved a bijection between reduced valid hook configurations and 3D-Dyck words.

Confirmed several of Sankar's conjectures regarding these configurations.

Derived formulas for counting specific 3D-Dyck words, including variants of tennis ball numbers.

Abstract

Valid hook configurations are combinatorial objects used to understand West's stack sorting map as well as cumulants in noncommutative probability theory. We show a bijection between reduced valid hook configurations on 312-avoiding permutations with the maximal allowed number of points and 3D-Dyck words, proving a conjecture of Sankar's. We extend to a bijection between all 312-avoiding reduced valid hook configurations and 3D-Dyck words with specified modifications. We show how these can be counted in terms of the number of 3D-Dyck words of length 3k in which exactly i Y's do not have an X immediately before them, the (k,i)-Duck words, and use this relationship to prove several properties about sums of 312-avoiding reduced valid hook configurations, including two more of Sankar's conjectures. We also show that the number of (k,1)-Duck words is given by a variant of the tennis ball numbers.