Showing 2013Show all
2 papers · 1 filter
math.CO2013
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…
math.CO2013
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:…