Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Sulzgruber, Robin"'
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 $A$, the set $\mathcal T$ of Shi tableaux naturally coincides with the set of Dyck
Externí odkaz:
http://arxiv.org/abs/2006.06949
Berget and Rhoades asked whether the permutation representation obtained by the action of $S_{n-1}$ on parking functions of length $n-1$ can be extended to a permutation action of $S_{n}$. We answer this question in the affirmative. We realize our mo
Externí odkaz:
http://arxiv.org/abs/2004.12093
Autor:
Alexandersson, Per, Sulzgruber, Robin
Publikováno v:
Advances in Mathematics Volume 400, (2022)
We give a new characterization of the vertical-strip LLT polynomials $\mathrm{LLT}_P(x;q)$ as the unique family of symmetric functions that satisfy certain combinatorial relations. This characterization is then used to prove an explicit combinatorial
Externí odkaz:
http://arxiv.org/abs/2004.09198
Autor:
Alexandersson, Per, Sulzgruber, Robin
Publikováno v:
International Mathematics Research Notices, Volume 2021, Issue 14, July 2021, Pages 10848-10907
Using the combinatorics of $\alpha$-unimodal sets, we establish two new results in the theory of quasisymmetric functions. First, we obtain the expansion of the fundamental basis into quasisymmetric power sums. Secondly, we prove that generating func
Externí odkaz:
http://arxiv.org/abs/1807.02460
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 implies via properties of the Edelman-Greene bijection results about
Externí odkaz:
http://arxiv.org/abs/1804.01795
Autor:
Alexandersson, Per a, ⁎, Sulzgruber, Robin b
Publikováno v:
In Advances in Mathematics 14 May 2022 400
Autor:
Sulzgruber, Robin
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 and multi-sets of rim-hooks. In turn this yields a bijective proof of th
Externí odkaz:
http://arxiv.org/abs/1710.09695
Autor:
Sulzgruber, Robin
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 Stanley, can be explained bijectively using the Hillman-Grassl corresponden
Externí odkaz:
http://arxiv.org/abs/1612.03922
Autor:
Sulzgruber, Robin, Thiel, Marko
Let $\Phi$ be an irreducible crystallographic root system with Weyl group $W$, coroot lattice $\check{Q}$ and Coxeter number $h$. Recently the second named author defined a uniform $W$-isomorphism $\zeta$ between the finite torus $\check{Q}/(mh+1)\ch
Externí odkaz:
http://arxiv.org/abs/1609.03128
Autor:
Schneider, Carsten, Sulzgruber, Robin
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. We obtain new asymptotic results on the average case and worst case co
Externí odkaz:
http://arxiv.org/abs/1606.07597