A refined enumeration of hex trees and related polynomials.

A hex tree is an ordered tree of which each vertex has updegree 0 , 1 , or 2 , and an edge from a vertex of updegree 1 is either left, median, or right. We present a refined enumeration of symmetric hex trees via a generalized binomial transform. It turns out that the refinement has a natural combinatorial interpretation by means of supertrees. We describe a bijection between symmetric hex trees and a certain class of supertrees. Some algebraic properties of the polynomials obtained in this procedure are also studied.