13 citations · 29 across the 6 of their papers we have counts for
13 papers
Patterns in Shi tableaux and Dyck paths
Myrto Kallipoliti, Robin Sulzgruber, Eleni Tzanaki
Shi tableaux are special binary fillings of certain Young diagrams which arise in the study of Shi hyperplane arrangements related to classical root systems. For type , the set…
Trimming the permutahedron to extend the parking space
Matjaž Konvalinka, Robin Sulzgruber, Vasu Tewari
Berget and Rhoades asked whether the permutation representation obtained by the action of on parking functions of length can be extended to a permutation action of…
A combinatorial expansion of vertical-strip LLT polynomials in the basis of elementary symmetric functions
Per Alexandersson, Robin Sulzgruber
We give a new characterization of the vertical-strip LLT polynomials as the unique family of symmetric functions that satisfy certain combinatorial relations.…
-partitions and -positivity
Per Alexandersson, Robin Sulzgruber
Using the combinatorics of -unimodal sets, we establish two new results in the theory of quasisymmetric functions. First, we obtain the expansion of the fundamental basis into q…
On random shifted standard Young tableaux and 132-avoiding sorting networks
Svante Linusson, Samu Potka, Robin Sulzgruber
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This…
Inserting rim-hooks into reverse plane partitions
Robin Sulzgruber
A new algorithm for inserting rim-hooks into reverse plane partitions is presented. The insertion is used to define a bijection between reverse plane partitions of a fixed shape an…
Building reverse plane partitions with rim-hook-shaped bricks
Robin Sulzgruber
The generating function of reverse plane partitions of a fixed shape factors into a product featuring the hook-lengths of this shape. This result, which was first obtained by Stanl…
On parking functions and the zeta map in types B,C and D
Robin Sulzgruber, Marko Thiel
Let be an irreducible crystallographic root system with Weyl group , coroot lattice and Coxeter number . Recently the second named author defined a uniform $W…
Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm
Carsten Schneider, Robin Sulzgruber
The Novelli-Pak-Stoyanovskii algorithm is a sorting algorithm for Young tableaux of a fixed shape that was originally devised to give a bijective proof of the hook-length formula.…
Rational Shi tableaux and the skew length statistic
Robin Sulzgruber
We define two refinements of the skew length statistic on simultaneous core partitions. The first one relies on hook lengths and is used to prove a refined version of the theorem s…
Type C parking functions and a zeta map
Robin Sulzgruber, Marko Thiel
We introduce type C parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type C parking functions to regio…
Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm
Robin Sulzgruber
The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyano…
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…