论文标题
分解减少的重复范围
The range of repetition in reduced decompositions
论文作者
论文摘要
鉴于置换w，我们查看简单反射S_K的范围在w的减少分解中出现。我们计算最小值，并在最大值上给出锋利的上限。该约束在W中的321-和3412个模式中，特别是它们的价值和位置与K相关。我们还表征了最小值和最大值等于何时，它可以完善辫子移动相当于321个模式的先前结果。
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in w, specifically as they relate in value and position to k. We also characterize when that minimum and maximum are equal, refining a previous result that braid moves are equivalent to 321-patterns.
