2000 character limit reached
Tower Diagrams and Pieri's Rule (1807.03764v1)
Published 10 Jul 2018 in math.CO
Abstract: We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm that describes Monk's Rule. Our result is different from the well-known descriptions (and proofs) of the rule by Bergeron-Billey and Kogan-Kumar and uses Sottile's version of Pieri's Rule.
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.