2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2014★ 2 cited
Playing jeu de taquin on d-complete posets
Lukas Riegler, Christoph Neumann
Using a modified version of jeu de taquin, Novelli, Pak and Stoyanovskii gave a bijective proof of the hook-length formula for counting standard Young tableaux of fixed shape. In t…
math.CO2013★ 1 cited
A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
Christoph Neumann, Robin Sulzgruber
We describe two aspects of the behaviour of entries of Young tableaux during the application of the Novelli-Pak-Stoyanovskii algorithm. We derive two theorems which both contain a…
math.CO2011
Constructing highly arc transitive digraphs using a layerwise direct product
Christoph Neumann
We introduce a construction of highly arc transitive digraphs using a layerwise direct product. This product generalizes some known classes of highly arc transitive digraphs but al…