Chords, trees and permutations
From MaRDI portal
Publication:686151
DOI10.1016/0012-365X(93)90326-OzbMath0782.05001OpenAlexW2052634117MaRDI QIDQ686151
Jean-Guy Penaud, Dulucq, Serge
Publication date: 11 January 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90326-o
Related Items
A bijective proof of a Touchard-Riordan formula, Formation of a giant component in the intersection graph of a random chord diagram, Enumeration of noncrossing trees on a circle, New production matrices for geometric graphs, A note on friezes of type \(\varLambda_p\), Locally oriented noncrossing trees, Exceptional and modern intervals of the Tamari lattice, Exceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees., From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices, Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections, The bounded derived categories of the Tamari lattices are fractionally Calabi-Yau, Geometric tree graphs of points in convex position, Analytic combinatorics of non-crossing configurations
Cites Work
- Short factorizations of permutations into transpositions
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- The enumeration of connected graphs and linked diagrams
- On a class of linked diagrams. I: Enumeration
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- Generating t-Ary Trees Lexicographically
- Historical Note on a Recurrent Combinatorial Problem
- Correspondences between plane trees and binary sequences
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Contribution a L'etude Du Probleme Des Timbres Poste
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- Motzkin numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item