Chords, trees and permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3149991 (Why is no real title available?)
- scientific article; zbMATH DE number 3752846 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3632553 (Why is no real title available?)
- scientific article; zbMATH DE number 4003522 (Why is no real title available?)
- scientific article; zbMATH DE number 3358536 (Why is no real title available?)
- scientific article; zbMATH DE number 3360173 (Why is no real title available?)
- scientific article; zbMATH DE number 3185005 (Why is no real title available?)
- scientific article; zbMATH DE number 3054984 (Why is no real title available?)
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Contribution a L'etude Du Probleme Des Timbres Poste
- Correspondences between plane trees and binary sequences
- Generating t-Ary Trees Lexicographically
- Historical Note on a Recurrent Combinatorial Problem
- Motzkin numbers
- On a class of linked diagrams. I: Enumeration
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Short factorizations of permutations into transpositions
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- The enumeration of connected graphs and linked diagrams
Cited in
(19)- Geometric tree graphs of points in convex position
- A bijective proof of a Touchard-Riordan formula
- scientific article; zbMATH DE number 5038484 (Why is no real title available?)
- Analytic combinatorics of non-crossing configurations
- Locally oriented noncrossing trees
- New production matrices for geometric graphs
- Creating improvisations on chord progressions using suffix trees
- Exceptional and modern intervals of the Tamari lattice
- A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration
- 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
- Formation of a giant component in the intersection graph of a random chord diagram
- Cuntz algebra automorphisms: graphs and stability of permutations
- Enumeration of noncrossing trees on a circle
- Pattern avoidance in parking functions
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Exceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees.
- The bounded derived categories of the Tamari lattices are fractionally Calabi-Yau
- A note on friezes of type \(\varLambda_p\)
This page was built for publication: Chords, trees and permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686151)