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 dimen...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/6414/pdf |
| _version_ | 1797270256427728896 |
|---|---|
| author | Jean-Christophe Aval Adrien Boussicault Bérénice Delcroix-Oger Florent Hivert Patxi Laborde-Zubieta |
| author_facet | Jean-Christophe Aval Adrien Boussicault Bérénice Delcroix-Oger Florent Hivert Patxi Laborde-Zubieta |
| author_sort | Jean-Christophe Aval |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T02:01:23Z |
| format | Article |
| id | doaj.art-0d2c4d92d2b949ba99e8bf62b342493a |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:01:23Z |
| publishDate | 2020-04-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-0d2c4d92d2b949ba99e8bf62b342493a2024-03-07T14:55:20ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502020-04-01DMTCS Proceedings, 28th...10.46298/dmtcs.64146414Non-ambiguous trees: new results and generalizationJean-Christophe Aval0Adrien Boussicault1Bérénice Delcroix-Oger2https://orcid.org/0000-0003-4067-8652Florent Hivert3https://orcid.org/0000-0002-7531-5985Patxi Laborde-Zubieta4Laboratoire Bordelais de Recherche en InformatiqueLaboratoire Bordelais de Recherche en InformatiqueInstitut de Mathématiques de Toulouse UMR5219Laboratoire de Recherche en InformatiqueLaboratoire Bordelais de Recherche en InformatiqueWe 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.https://dmtcs.episciences.org/6414/pdf[math.math-co]mathematics [math]/combinatorics [math.co] |
| spellingShingle | Jean-Christophe Aval Adrien Boussicault Bérénice Delcroix-Oger Florent Hivert Patxi Laborde-Zubieta Non-ambiguous trees: new results and generalization Discrete Mathematics & Theoretical Computer Science [math.math-co]mathematics [math]/combinatorics [math.co] |
| title | Non-ambiguous trees: new results and generalization |
| title_full | Non-ambiguous trees: new results and generalization |
| title_fullStr | Non-ambiguous trees: new results and generalization |
| title_full_unstemmed | Non-ambiguous trees: new results and generalization |
| title_short | Non-ambiguous trees: new results and generalization |
| title_sort | non ambiguous trees new results and generalization |
| topic | [math.math-co]mathematics [math]/combinatorics [math.co] |
| url | https://dmtcs.episciences.org/6414/pdf |
| work_keys_str_mv | AT jeanchristopheaval nonambiguoustreesnewresultsandgeneralization AT adrienboussicault nonambiguoustreesnewresultsandgeneralization AT berenicedelcroixoger nonambiguoustreesnewresultsandgeneralization AT florenthivert nonambiguoustreesnewresultsandgeneralization AT patxilabordezubieta nonambiguoustreesnewresultsandgeneralization |