Lehmer code: Difference between revisions

Content deleted Content added
m Number of right-to-left minima and maxima: LaTeX spacing clean up, replaced: \ </math> → </math> (2) using AWB
Independence of relative ranks: consistent zero-indexing
Line 40:
=== Independence of relative ranks ===
 
The Lehmer code defines a bijection from the [[symmetric group]] ''S''<sub>''n''</sub> to the Cartesian product <math>[n]\times[n-1]\times\cdots\times[2]\times[1]</math>, where [''k''] designates the ''k''-element set <math>\{0,1,\ldots,k-1\}</math>. As a consequence, under the uniform law on the ''S''<sub>''n''</sub>, the component ''L''(''σ'')<sub>''i''</sub> defines a uniformly distributed [[random variable]] on {{math|[''n'' + 1 − ''i'']}}, and these random variables are mutually [[Independence (probability theory)|independent]], because they are projections on different factors of a [[Cartesian product]].
 
=== Number of right-to-left minima and maxima ===