T. J. Mclarnan

collaborators

2 papers

math.CO2022

Robinson-Schensted Algorithms Obtained from Tableau Recursions

Adriano M. Garsia, Timothy J. McLarnan

The numbers $f_{λ}$ of standard tableaux of shape $λ ⊢ n$ satisfy 2 fundamental recursions: $f_{λ} = \sum f_{λ^{-}}$ and $(n + 1) f_{λ} = \sum f_{λ^{+}}$ , where $λ^{-}$ and $λ^{+}$ run over all…

math.CO2002

Counterexamples to the 0-1 conjecture

Timothy J. McLarnan, Gregory S. Warrington

For permutations x and w, let mu(x,w) be the coefficient of highest possible degree in the Kazhdan-Lusztig polynomial P_{x,w}. It is well-known that the coefficients mu(x,w) arise…