Асимптотические свойства числа инверсий в раскрашенных деревьях

DOI10.4213/mvk305zbMath1473.05056OpenAlexW2997397062MaRDI QIDQ3383091

Vladimir A. 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

zbMATH Keywords

limit theoremsinversioncolored tree\(b\)-ary plane rooted tree

Mathematics Subject Classification ID

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

Related Items (1)

Асимптотические свойства числа инверсий в случайном лесе

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

This page was built for publication: Асимптотические свойства числа инверсий в раскрашенных деревьях