Alladi Ramakrishnan Hall

Some Enumerative and Bijective Results Related to Non Ambiguous Trees

Bishal Deb

CMI

This talk shall be an extension of the last lecture of Prof.
Viennot in his course The Cellular Ansatz. We shall first prove a formula
counting the number of Non Ambiguous Trees (NAT). Then we shall see a hook
length formula for NATs and finally if time permits we shall see a bijection
between Parallelogram Polyominoes and Binary Trees or a bijection between
Complete NATs and "heaps of chopsticks."