We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain q-versions of our formula. We finally generalise NATs to higher dimension.
翻译:我们提出了不矛盾的树木的新定义,称为二进制树,因此我们得到了一个差别方程式,其解决办法可以按组合来描述。这为NAT的数量提供了一个新的公式。我们还获得了我们的公式的Q变式。我们终于将NAT概括到更高的维度上。