Chords, trees and permutations

DOI10.1016/0012-365X(93)90326-OzbMATH Open0782.05001OpenAlexW2052634117MaRDI QIDQ686151FDOQ686151

Authors: J.-G. Penaud, Serge Dulucq 

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

Recommendations

• Labelled trees and factorizations of a cycle into transpositions
• Publication:4502530
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• scientific article; zbMATH DE number 6007658
• scientific article; zbMATH DE number 2221988

zbMATH Keywords

binary treesCatalan numberscyclic permutationchord configuration

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05)

Cites Work

• Title not available (Why is that?)
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• Title not available (Why is that?)
• Short factorizations of permutations into transpositions
• Motzkin numbers
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Title not available (Why is that?)
• Contribution a L'etude Du Probleme Des Timbres Poste
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• On a class of linked diagrams. I: Enumeration
• Correspondences between plane trees and binary sequences
• Generating t-Ary Trees Lexicographically
• Title not available (Why is that?)
• The enumeration of connected graphs and linked diagrams
• Title not available (Why is that?)
• Historical Note on a Recurrent Combinatorial Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (19)

• Creating improvisations on chord progressions using suffix trees
• Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections
• Exceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees.
• A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration
• Geometric tree graphs of points in convex position
• Analytic combinatorics of non-crossing configurations
• Title not available (Why is that?)
• Locally oriented noncrossing trees
• New production matrices for geometric graphs
• Cuntz algebra automorphisms: graphs and stability of permutations
• The bounded derived categories of the Tamari lattices are fractionally Calabi-Yau
• Exceptional and modern intervals of the Tamari lattice
• Formation of a giant component in the intersection graph of a random chord diagram
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• A bijective proof of a Touchard-Riordan formula
• A note on friezes of type \(\varLambda_p\)
• Pattern avoidance in parking functions
• Enumeration of noncrossing trees on a circle
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

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)