2 citations · 3 across the 7 of their papers we have counts for
4 papers · 1 filter
Tower Diagrams and Pieri's Rule
Olcay Coşkun, Müge Taşkın
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…
Tower tableaux and Schubert polynomials
Olcay Coşkun, Müge Taşkın
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a genera…
Sorting and generating reduced words
Olcay Coşkun, Müge Taşkın
We introduce a partial order on the set of all reduced words of a given permutation , called \emph{directed-braid poset} of . This poset enables us to produce two algorithms:…
Tower Tableaux
Olcay Coşkun, Müge Taşkın
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tow…