Constructs a probabilistic bijection between twenty-vertex configurations with fixed west boundary and Gelfand-Tsetlin patterns avoiding three equal entries in a row, then derives an enumeration formula for the free-boundary case.
and Robbins, David P
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A explicit construction maps permutations to 1- and 2-tournaments so that their score sequences equal the xray of the permutation, showing prior conjectures are special cases of a broader statement that the authors also conjecture.
citing papers explorer
-
A probabilistic bijection between twenty-vertex configurations with a free west boundary and Gelfand-Tsetlin patterns avoiding three equal entries in a row
Constructs a probabilistic bijection between twenty-vertex configurations with fixed west boundary and Gelfand-Tsetlin patterns avoiding three equal entries in a row, then derives an enumeration formula for the free-boundary case.
-
Relating tournaments and permutations with xrays
A explicit construction maps permutations to 1- and 2-tournaments so that their score sequences equal the xray of the permutation, showing prior conjectures are special cases of a broader statement that the authors also conjecture.