Add to ORKGWe investigate the enumeration of non-crossing tree realizations of integer sequences, and we consider a special case in four parameters, that can be seen as a four-dimensional tetrahedron that generalizes Pascal's triangle and the Catalan numbers
AbstractCertain families of combinatorial objects admit recursive descriptions in terms of generatin...
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a di...
AbstractWe use Kashiwara–Nakashima combinatorics of crystal graphs associated with the roots systems...
We investigate the enumeration of non-crossing tree realizations of integer sequences, and we consid...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe present a new definition of non-ambiguous trees (NATs) as labelled binary t...
AbstractWe try to understand certain complex phenomena which appear in the study of tree morphisms i...
AbstractWe present a characterization of planarity based on Trémaux trees (i.e. DFS trees), from whi...
AbstractSome new sequences are introduced which satisfy quadratic recurrence rules similar to those ...
AbstractSolving the first nonmonotonic, longer-than-three instance of a classic enumeration problem,...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
This article corresponds, up to minor typo corrections, to the article submitted to Discrete Mathema...
AbstractCertain families of combinatorial objects admit recursive descriptions in terms of generatin...
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a di...
AbstractWe use Kashiwara–Nakashima combinatorics of crystal graphs associated with the roots systems...
We investigate the enumeration of non-crossing tree realizations of integer sequences, and we consid...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
International audienceWe present a new definition of non-ambiguous trees (NATs) as labelled binary t...
AbstractWe try to understand certain complex phenomena which appear in the study of tree morphisms i...
AbstractWe present a characterization of planarity based on Trémaux trees (i.e. DFS trees), from whi...
AbstractSome new sequences are introduced which satisfy quadratic recurrence rules similar to those ...
AbstractSolving the first nonmonotonic, longer-than-three instance of a classic enumeration problem,...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
This article corresponds, up to minor typo corrections, to the article submitted to Discrete Mathema...
AbstractCertain families of combinatorial objects admit recursive descriptions in terms of generatin...
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a di...
AbstractWe use Kashiwara–Nakashima combinatorics of crystal graphs associated with the roots systems...