Coherent permutations with descent statistic and the boundary problem for the graph of zigzag diagrams

Research paper by Alexander Gnedin, Grigori Olshanski

Indexed on: 13 Feb '06Published on: 13 Feb '06Published in: Mathematics - Combinatorics


The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on the algebra of quasi-symmetric functions. We establish connections to some further relatives of Young's lattice and solve the boundary problem by reducing it to the classification of spreadable total orders on integers, as recently obtained by Jacka and Warren.