期刊论文详细信息
JOURNAL OF COMBINATORIAL THEORY SERIES A 卷:120
Tower tableaux
Article
Coskun, Olcay1  Taskin, Muge1 
[1] Bogazici Univ, Matemat Bolumu, TR-34342 Istanbul, Turkey
关键词: Reduced word;    Finite permutation;    Tower diagram;    Sliding algorithm;   
DOI  :  10.1016/j.jcta.2013.01.007
来源: Elsevier
PDF
【 摘 要 】

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 tower diagrams. We show that the algorithm is well-defined only for reduced words which makes the algorithm a test for reducibility. Using the algorithm, a bijection between tower diagrams and finite permutations is obtained and it is shown that this bijection specializes to a bijection between certain labellings of a given tower diagram and reduced expressions of the corresponding permutation. (c) 2013 Elsevier Inc. All rights reserved.

【 授权许可】

Free   

【 预 览 】
附件列表
Files Size Format View
10_1016_j_jcta_2013_01_007.pdf 583KB PDF download
  文献评价指标  
  下载次数:0次 浏览次数:0次