2000 character limit reached
Transitioning between tableaux and spider bases for Specht modules
Published 12 Nov 2019 in math.RT, math.CO, math.GT, and math.QA | (1911.05049v2)
Abstract: Regarding the Specht modules associated to the two-row partition $(n,n)$, we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the $A_1$-web basis (i.e. cup diagrams), and prove that the entries in this matrix are positive in the upper-triangular portion with respect to a certain partial order.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.