AbstractTwo mirror-image isomorphisms between general bracketings and binary bracketings are formalized which parallel the isomorphisms described by De Bruijn and Morselt between plane trees and trivalent plane trees. These maps lead to automorphisms on these four Catalan families. It is found that the orbit structure of these automorphisms is determined by certain “primitive” elements of the four families, and that the enumerator pn of these primitive elements satisfies the equations: pn = mn−2 + mn−1, where mn = Σk=0 (2kn)ck, cn the Catalan numbers, and cn+2=∑k=0nkpk+2. It is then shown that these automorphisms yield isomorphisms between several interesting subsets of the trees and brackets, most of them enumerated by mn. In particular, i...
AbstractIn this paper we compute the number of reduced decompositions of certain permutations σ ∈ Sn...
AbstractFour equations are presented relating the well-known Catalan numbers and the Motzkin numbers...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...
AbstractTwo mirror-image isomorphisms between general bracketings and binary bracketings are formali...
Abstract. We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the firs...
We consider unicellular maps, or polygon gluings, of fixed genus. In FPSAC '09 the first author gave...
Two families of polynomials are introduced, which generalize the sequence of Catalan numbers. Both f...
International audienceWe consider unicellular maps, or polygon gluings, of fixed genus. In FPSAC '09...
AbstractMotivated by a formula of A. Postnikov relating binary trees, we define the hook length poly...
Trees, sometimes called semilinear orders, are partially ordered sets in which every initial segment...
AbstractThe main result of this paper states that the isomorphism problem for ω-automatic trees of f...
The problem we discuss here is the conjecture of Ádám [1] concerning the isomorphism problem of cycl...
We consider plane trees whose vertices are given labels from the set {1, 2,..., k} in such a way tha...
AbstractWe consider plane trees whose vertices are given labels from the set {1,2,…,k} in such a way...
AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed ...
AbstractIn this paper we compute the number of reduced decompositions of certain permutations σ ∈ Sn...
AbstractFour equations are presented relating the well-known Catalan numbers and the Motzkin numbers...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...
AbstractTwo mirror-image isomorphisms between general bracketings and binary bracketings are formali...
Abstract. We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the firs...
We consider unicellular maps, or polygon gluings, of fixed genus. In FPSAC '09 the first author gave...
Two families of polynomials are introduced, which generalize the sequence of Catalan numbers. Both f...
International audienceWe consider unicellular maps, or polygon gluings, of fixed genus. In FPSAC '09...
AbstractMotivated by a formula of A. Postnikov relating binary trees, we define the hook length poly...
Trees, sometimes called semilinear orders, are partially ordered sets in which every initial segment...
AbstractThe main result of this paper states that the isomorphism problem for ω-automatic trees of f...
The problem we discuss here is the conjecture of Ádám [1] concerning the isomorphism problem of cycl...
We consider plane trees whose vertices are given labels from the set {1, 2,..., k} in such a way tha...
AbstractWe consider plane trees whose vertices are given labels from the set {1,2,…,k} in such a way...
AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed ...
AbstractIn this paper we compute the number of reduced decompositions of certain permutations σ ∈ Sn...
AbstractFour equations are presented relating the well-known Catalan numbers and the Motzkin numbers...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...