# zbMATH — the first resource for mathematics

Braid moves in commutation classes of the symmetric group. (English) Zbl 1358.05308
Summary: We prove that the expected number of braid moves in the commutation class of the reduced word $$(s_1 s_2 \cdots s_{n - 1})(s_1 s_2 \cdots s_{n - 2}) \cdots(s_1 s_2)(s_1)$$ for the long element in the symmetric group $$\mathfrak{S}_n$$ is one. This is a variant of a similar result by V. Reiner [ibid. 26, No. 6, 1019–1021 (2005; Zbl 1071.20003)], who proved that the expected number of braid moves in a random reduced word for the long element is one. The proof is bijective and uses Viennot’s theory of heaps and variants of the promotion operator [G. X. Viennot, Lect. Notes Math. 1234, 321–350 (1986; Zbl 0618.05008)]. In addition, we provide a refinement of this result on orbits under the action of even and odd promotion operators. This gives an example of a homomesy for a nonabelian (dihedral) group that is not induced by an abelian subgroup. Our techniques extend to more general posets and to other statistics.

##### MSC:
 05E10 Combinatorial aspects of representation theory 05E15 Combinatorial aspects of groups and algebras (MSC2010) 20B30 Symmetric groups
##### Software:
Sage-Combinat; SageMath
Full Text:
##### References:
 [1] Billey, Sara; Lam, Tao Kai, Vexillary elements in the hyperoctahedral group, J. Algebraic Combin., 8, 2, 139-152, (1998) · Zbl 0921.05060 [2] Edelman, Paul; Greene, Curtis, Balanced tableaux, Adv. Math., 63, 1, 42-99, (1987) · Zbl 0616.05005 [3] Haiman, Mark D., Dual equivalence with applications, including a conjecture of proctor, Discrete Math., 99, 1-3, 79-113, (1992) · Zbl 0760.05093 [4] Hohlweg, Christophe; Lortie, Jonathan; Raymond, Annie, The centers of gravity of the associahedron and of the permutahedron are the same, Electron. J. Combin., 17, 1, 14, (2010), Research Paper 72 · Zbl 1225.05246 [5] Kraśkiewicz, Witold, Reduced decompositions in hyperoctahedral groups, C. R. Acad. Sci. Paris Sér. I Math., 309, 16, 903-907, (1989) · Zbl 0717.05005 [6] Panyushev, Dmitri I., On orbits of antichains of positive roots, European J. Combin., 30, 2, 586-594, (2009) · Zbl 1165.06001 [7] Pilaud, Vincent; Stump, Christian, Vertex barycenter of generalized associahedra, Proc. Amer. Math. Soc., 143, 6, 2623-2636, (2015) · Zbl 1316.52022 [8] Pon, Steven; Wang, Qiang, Promotion and evacuation on standard Young tableaux of rectangle and staircase shape, Electron. J. Combin., 18, 1, 18, (2011), Paper 18 · Zbl 1219.05198 [9] Propp, James; Roby, Tom, Homomesy in products of two chains, Electron. J. Combin., 22, 3, 29, (2015), Paper 3.4 · Zbl 1319.05151 [10] Reiner, Victor, Note on the expected number of Yang-Baxter moves applicable to reduced decompositions, European J. Combin., 26, 6, 1019-1021, (2005) · Zbl 1071.20003 [11] Tom Roby, Dynamical algebraic combinatorics and the homomesy phenomenon. Preprint, 2015. · Zbl 1354.05146 [12] The Sage-Combinat community. Sage-Combinat: enhancing Sage as a toolbox for computer exploration in algebraic combinatorics, 2008. http://combinat.sagemath.org. [13] The Sage Developers. SageMath, the Sage Mathematics Software System (Version 7.3), 2016. http://www.sagemath.org. [14] Stanley, Richard P., Two poset polytopes, Discrete Comput. Geom., 1, 1, 9-23, (1986) · Zbl 0595.52008 [15] Stanley, Richard P., Promotion and evacuation, Electron. J. Combin., 16, 2, Special volume in honor of Anders Bjorner, 24, (2009), Research Paper 9 · Zbl 1169.06002 [16] Tenner, Bridget Eileen, On expected factors in reduced decompositions in type $$B$$, European J. Combin., 28, 4, 1144-1151, (2007) · Zbl 1147.05060 [17] Viennot, Gérard Xavier, Heaps of pieces. I. basic definitions and combinatorial lemmas, (Graph Theory and Ots applications: East and West, Jinan, 1986, Ann. New York Acad. Sci., vol. 576, (1989), New York Acad. Sci New York), 542-570 · Zbl 0792.05012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.