Non-ambiguous trees: new results and generalization

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differ- ential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of our formula. And we generalize NATs to higher dimension.

Domaines

Combinatoire [math.CO]

Fichier principal

final_112.pdf (304.68 Ko)

CCSD Sciencesconf.org : Connectez-vous pour contacter le contributeur

https://hal.science/hal-02173753

Soumis le : jeudi 4 juillet 2019-16:27:36

Dernière modification le : lundi 2 décembre 2024-03:04:10

Dates et versions

hal-02173753 , version 1 (04-07-2019)

Identifiants

HAL Id : hal-02173753 , version 1
DOI : 10.46298/dmtcs.6414

Citer

Jean-Christophe Aval, Adrien Boussicault, Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta. Non-ambiguous trees: new results and generalization. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6414⟩. ⟨hal-02173753⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-TLSE2 CNRS INSA-TOULOUSE INSMI UNIV-BORDEAUX IMT UMR8623 UT1-CAPITOLE CENTRALESUPELEC UNIV-PARIS-SACLAY INSA-GROUPE GS-LIFE-SCIENCES-HEALTH UNIV-UT3 UT3-TOULOUSEINP

346 Consultations

628 Téléchargements