Parry–Daniels map

Given an integer n ≥ 1, let Σ denote the n-dimensional simplex in Rⁿ⁺¹ given by

${\displaystyle \Sigma$ :=\{x=(x_{0},x_{1},\dots ,x_{n})\in \mathbb {R} ^{n+1}|0\leq x_{i}\leq 1{\mbox{ for each }}i{\mbox{ and }}x_{0}+x_{1}+\dots +x_{n}=1\}.}

Let π be a permutation such that

${\displaystyle x_{\pi (0)}\leq x_{\pi (1)}\leq \dots \leq x_{\pi (n)}.}$

Then the Parry–Daniels map

${\displaystyle T_{\pi }:\Sigma \to \Sigma }$

is defined by

${\displaystyle T_{\pi }(x_{0},x_{1},\dots ,x_{n}):=\left({\frac {x_{\pi (0)}}{x_{\pi (n)}}},{\frac {x_{\pi (1)}-x_{\pi (0)}}{x_{\pi (n)}}},\dots ,{\frac {x_{\pi (n)}-x_{\pi (n-1)}}{x_{\pi (n)}}}\right).}$