Asymptotic properties of the inversion number in colored trees

DOI10.4213/MVK305zbMATH Open1473.05056OpenAlexW2997397062MaRDI QIDQ3383091FDOQ3383091

Authors: Vladimir Vatutin 

Publication date: 23 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk305

Recommendations

• Limiting distributions for the number of inversions in labelled tree families
• Inversions in split trees and conditional Galton-Watson trees
• Asymptotic properties of the number of inversions in a random forest
• Enumeration of trees by inversions
• Some properties of planar trees with a hanging root

zbMATH Keywords

inversionlimit theoremscolored tree\(b\)-ary plane rooted tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• The number of readings of non-equiprobable files under stable sorting
• Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms

Cited In (2)

• Asymptotic properties of the number of inversions in a random forest
• Limiting distributions for the number of inversions in labelled tree families

This page was built for publication: Asymptotic properties of the inversion number in colored trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383091)